/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:29:54,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:29:54,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:29:54,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:29:54,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:29:54,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:29:54,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:29:54,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:29:54,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:29:54,256 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:29:54,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:29:54,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:29:54,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:29:54,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:29:54,259 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:29:54,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:29:54,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:29:54,259 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:29:54,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:29:54,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:29:54,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:29:54,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:29:54,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:29:54,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:29:54,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:29:54,261 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:29:54,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:29:54,262 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:29:54,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:29:54,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:29:54,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:29:54,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:29:54,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:54,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:29:54,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:29:54,265 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:29:54,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:29:54,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:29:54,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:29:54,486 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:29:54,487 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:29:54,488 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-33.i [2023-12-15 21:29:55,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:29:55,650 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:29:55,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-33.i [2023-12-15 21:29:55,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1576f86af/6a62a01517ba4899b1d6e84f8bad74d7/FLAGb30982476 [2023-12-15 21:29:55,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1576f86af/6a62a01517ba4899b1d6e84f8bad74d7 [2023-12-15 21:29:55,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:29:55,672 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:29:55,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:55,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:29:55,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:29:55,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee4e41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55, skipping insertion in model container [2023-12-15 21:29:55,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,703 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:29:55,821 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-33.i[916,929] [2023-12-15 21:29:55,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:55,877 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:29:55,885 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-33.i[916,929] [2023-12-15 21:29:55,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:55,936 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:29:55,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55 WrapperNode [2023-12-15 21:29:55,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:55,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:55,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:29:55,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:29:55,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,992 INFO L138 Inliner]: procedures = 29, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2023-12-15 21:29:55,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:55,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:29:55,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:29:55,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:29:56,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,040 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 44, 21, 11, 31]. 38 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 2, 2]. The 15 writes are split as follows [0, 1, 5, 4, 3, 2]. [2023-12-15 21:29:56,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:29:56,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:29:56,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:29:56,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:29:56,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:56,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:56,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:56,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:29:56,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:29:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:29:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:29:56,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:29:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:29:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:29:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:29:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:29:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:29:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:29:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:29:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:29:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:29:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:29:56,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:29:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:29:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:29:56,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:29:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:29:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:29:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:29:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:29:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:29:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:29:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:29:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:29:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:29:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:29:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:29:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:29:56,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:29:56,266 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:29:56,268 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:29:56,670 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:29:56,704 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:29:56,704 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:29:56,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:56 BoogieIcfgContainer [2023-12-15 21:29:56,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:29:56,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:29:56,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:29:56,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:29:56,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:29:55" (1/3) ... [2023-12-15 21:29:56,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69adb70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:56, skipping insertion in model container [2023-12-15 21:29:56,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (2/3) ... [2023-12-15 21:29:56,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69adb70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:56, skipping insertion in model container [2023-12-15 21:29:56,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:56" (3/3) ... [2023-12-15 21:29:56,711 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-33.i [2023-12-15 21:29:56,723 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:29:56,723 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:29:56,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:29:56,759 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;@246b39c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:29:56,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:29:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 82 states have (on average 1.548780487804878) internal successors, (127), 83 states have internal predecessors, (127), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:29:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:29:56,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:56,770 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:56,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:56,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1404313747, now seen corresponding path program 1 times [2023-12-15 21:29:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457713535] [2023-12-15 21:29:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:29:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:29:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:29:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457713535] [2023-12-15 21:29:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457713535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:56,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:56,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:29:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014824739] [2023-12-15 21:29:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:56,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:29:56,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:57,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:29:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:29:57,014 INFO L87 Difference]: Start difference. First operand has 94 states, 82 states have (on average 1.548780487804878) internal successors, (127), 83 states have internal predecessors, (127), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-15 21:29:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:57,060 INFO L93 Difference]: Finished difference Result 185 states and 297 transitions. [2023-12-15 21:29:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:29:57,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2023-12-15 21:29:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:57,070 INFO L225 Difference]: With dead ends: 185 [2023-12-15 21:29:57,070 INFO L226 Difference]: Without dead ends: 92 [2023-12-15 21:29:57,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:29:57,077 INFO L413 NwaCegarLoop]: 136 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, 136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:57,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-15 21:29:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-15 21:29:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 81 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:29:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 140 transitions. [2023-12-15 21:29:57,120 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 140 transitions. Word has length 93 [2023-12-15 21:29:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:57,120 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 140 transitions. [2023-12-15 21:29:57,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-15 21:29:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2023-12-15 21:29:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:29:57,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:57,123 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:57,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:29:57,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:57,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2084913651, now seen corresponding path program 1 times [2023-12-15 21:29:57,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:57,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096061799] [2023-12-15 21:29:57,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:29:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:29:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:29:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:57,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096061799] [2023-12-15 21:29:57,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096061799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:57,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:57,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:57,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711120501] [2023-12-15 21:29:57,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:57,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:57,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:57,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:57,355 INFO L87 Difference]: Start difference. First operand 92 states and 140 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-15 21:29:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:57,407 INFO L93 Difference]: Finished difference Result 189 states and 288 transitions. [2023-12-15 21:29:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2023-12-15 21:29:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:57,408 INFO L225 Difference]: With dead ends: 189 [2023-12-15 21:29:57,409 INFO L226 Difference]: Without dead ends: 98 [2023-12-15 21:29:57,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-15 21:29:57,410 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:57,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 397 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-15 21:29:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-15 21:29:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 83 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:29:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2023-12-15 21:29:57,417 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 93 [2023-12-15 21:29:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:57,418 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2023-12-15 21:29:57,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-15 21:29:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2023-12-15 21:29:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:29:57,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:57,420 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:57,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:29:57,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:57,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1969813899, now seen corresponding path program 1 times [2023-12-15 21:29:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:57,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878895211] [2023-12-15 21:29:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:29:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:29:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:29:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878895211] [2023-12-15 21:29:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878895211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:57,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817114743] [2023-12-15 21:29:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:57,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:57,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:57,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:57,592 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:29:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:57,638 INFO L93 Difference]: Finished difference Result 191 states and 288 transitions. [2023-12-15 21:29:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2023-12-15 21:29:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:57,641 INFO L225 Difference]: With dead ends: 191 [2023-12-15 21:29:57,641 INFO L226 Difference]: Without dead ends: 98 [2023-12-15 21:29:57,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-15 21:29:57,643 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 3 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 397 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-15 21:29:57,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 397 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-15 21:29:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2023-12-15 21:29:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 85 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:29:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2023-12-15 21:29:57,660 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 93 [2023-12-15 21:29:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:57,660 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2023-12-15 21:29:57,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:29:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2023-12-15 21:29:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:29:57,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:57,662 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:57,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:29:57,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:57,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1969873481, now seen corresponding path program 1 times [2023-12-15 21:29:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561283511] [2023-12-15 21:29:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:29:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:29:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:29:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561283511] [2023-12-15 21:29:58,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561283511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:58,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:29:58,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446642944] [2023-12-15 21:29:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:58,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:29:58,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:58,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:29:58,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:29:58,012 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:29:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:58,137 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2023-12-15 21:29:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:58,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2023-12-15 21:29:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:58,140 INFO L225 Difference]: With dead ends: 262 [2023-12-15 21:29:58,140 INFO L226 Difference]: Without dead ends: 167 [2023-12-15 21:29:58,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:29:58,150 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 246 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:58,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 557 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-15 21:29:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 98. [2023-12-15 21:29:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:29:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2023-12-15 21:29:58,161 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 93 [2023-12-15 21:29:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:58,161 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2023-12-15 21:29:58,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:29:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2023-12-15 21:29:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:29:58,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:58,162 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:58,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:29:58,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:58,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 958756231, now seen corresponding path program 1 times [2023-12-15 21:29:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430396865] [2023-12-15 21:29:58,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:29:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:29:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-15 21:29:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:58,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430396865] [2023-12-15 21:29:58,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430396865] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:29:58,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269465869] [2023-12-15 21:29:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:58,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:29:58,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:29:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-15 21:29:58,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:29:58,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-15 21:29:59,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:29:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 21:29:59,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:29:59,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-15 21:29:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-15 21:29:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269465869] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:29:59,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:29:59,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2023-12-15 21:29:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623021450] [2023-12-15 21:29:59,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:29:59,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 21:29:59,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:59,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 21:29:59,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-12-15 21:29:59,240 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 9 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2023-12-15 21:29:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:59,694 INFO L93 Difference]: Finished difference Result 301 states and 444 transitions. [2023-12-15 21:29:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 21:29:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 9 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) Word has length 93 [2023-12-15 21:29:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:59,698 INFO L225 Difference]: With dead ends: 301 [2023-12-15 21:29:59,698 INFO L226 Difference]: Without dead ends: 204 [2023-12-15 21:29:59,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2023-12-15 21:29:59,700 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 437 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:59,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1502 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:29:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-15 21:29:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 143. [2023-12-15 21:29:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 121 states have internal predecessors, (171), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:29:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 207 transitions. [2023-12-15 21:29:59,716 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 207 transitions. Word has length 93 [2023-12-15 21:29:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:59,717 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 207 transitions. [2023-12-15 21:29:59,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 9 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2023-12-15 21:29:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 207 transitions. [2023-12-15 21:29:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:29:59,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:59,718 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:59,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:29:59,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:59,937 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:59,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash 449283141, now seen corresponding path program 1 times [2023-12-15 21:29:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359393550] [2023-12-15 21:29:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:00,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:00,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359393550] [2023-12-15 21:30:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359393550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:00,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:00,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378330192] [2023-12-15 21:30:00,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:00,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:00,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:00,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:00,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:00,886 INFO L87 Difference]: Start difference. First operand 143 states and 207 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:01,282 INFO L93 Difference]: Finished difference Result 462 states and 684 transitions. [2023-12-15 21:30:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:30:01,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2023-12-15 21:30:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:01,284 INFO L225 Difference]: With dead ends: 462 [2023-12-15 21:30:01,284 INFO L226 Difference]: Without dead ends: 365 [2023-12-15 21:30:01,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:30:01,285 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 414 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:01,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1395 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:30:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-12-15 21:30:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 256. [2023-12-15 21:30:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 224 states have (on average 1.4508928571428572) internal successors, (325), 224 states have internal predecessors, (325), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2023-12-15 21:30:01,299 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 93 [2023-12-15 21:30:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:01,300 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2023-12-15 21:30:01,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2023-12-15 21:30:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:30:01,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:01,301 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:01,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:30:01,301 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:01,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash 230428423, now seen corresponding path program 1 times [2023-12-15 21:30:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437983348] [2023-12-15 21:30:01,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:01,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437983348] [2023-12-15 21:30:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437983348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445825243] [2023-12-15 21:30:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:01,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:01,490 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:01,614 INFO L93 Difference]: Finished difference Result 490 states and 734 transitions. [2023-12-15 21:30:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:30:01,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2023-12-15 21:30:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:01,615 INFO L225 Difference]: With dead ends: 490 [2023-12-15 21:30:01,616 INFO L226 Difference]: Without dead ends: 280 [2023-12-15 21:30:01,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-15 21:30:01,616 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 146 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:01,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 512 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-12-15 21:30:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 260. [2023-12-15 21:30:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.4429824561403508) internal successors, (329), 228 states have internal predecessors, (329), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2023-12-15 21:30:01,631 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 93 [2023-12-15 21:30:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:01,632 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2023-12-15 21:30:01,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2023-12-15 21:30:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:30:01,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:01,633 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:01,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:30:01,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:01,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash -859298629, now seen corresponding path program 1 times [2023-12-15 21:30:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:01,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615302285] [2023-12-15 21:30:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615302285] [2023-12-15 21:30:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615302285] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:01,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119209985] [2023-12-15 21:30:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:01,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:01,709 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:01,807 INFO L93 Difference]: Finished difference Result 712 states and 1052 transitions. [2023-12-15 21:30:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:30:01,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2023-12-15 21:30:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:01,809 INFO L225 Difference]: With dead ends: 712 [2023-12-15 21:30:01,809 INFO L226 Difference]: Without dead ends: 498 [2023-12-15 21:30:01,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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-15 21:30:01,810 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 169 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:01,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 699 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-12-15 21:30:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 284. [2023-12-15 21:30:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 252 states have (on average 1.4484126984126984) internal successors, (365), 252 states have internal predecessors, (365), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 419 transitions. [2023-12-15 21:30:01,826 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 419 transitions. Word has length 94 [2023-12-15 21:30:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:01,826 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 419 transitions. [2023-12-15 21:30:01,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 419 transitions. [2023-12-15 21:30:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:30:01,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:01,827 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:01,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:30:01,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:01,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2140521959, now seen corresponding path program 1 times [2023-12-15 21:30:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:01,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849029176] [2023-12-15 21:30:01,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:01,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:01,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849029176] [2023-12-15 21:30:01,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849029176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:01,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:01,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:01,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220916762] [2023-12-15 21:30:01,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:01,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:01,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:01,930 INFO L87 Difference]: Start difference. First operand 284 states and 419 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:02,017 INFO L93 Difference]: Finished difference Result 674 states and 996 transitions. [2023-12-15 21:30:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:02,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2023-12-15 21:30:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:02,020 INFO L225 Difference]: With dead ends: 674 [2023-12-15 21:30:02,020 INFO L226 Difference]: Without dead ends: 436 [2023-12-15 21:30:02,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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-15 21:30:02,021 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 176 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:02,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 566 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-12-15 21:30:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 284. [2023-12-15 21:30:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 252 states have (on average 1.4365079365079365) internal successors, (362), 252 states have internal predecessors, (362), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 416 transitions. [2023-12-15 21:30:02,036 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 416 transitions. Word has length 94 [2023-12-15 21:30:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:02,036 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 416 transitions. [2023-12-15 21:30:02,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 416 transitions. [2023-12-15 21:30:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:30:02,037 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:02,037 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:02,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:30:02,037 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:02,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash 969744106, now seen corresponding path program 1 times [2023-12-15 21:30:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11829431] [2023-12-15 21:30:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:02,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:02,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11829431] [2023-12-15 21:30:02,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11829431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:02,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:02,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:02,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545419794] [2023-12-15 21:30:02,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:02,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:02,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:02,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:02,230 INFO L87 Difference]: Start difference. First operand 284 states and 416 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:02,282 INFO L93 Difference]: Finished difference Result 663 states and 982 transitions. [2023-12-15 21:30:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-12-15 21:30:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:02,284 INFO L225 Difference]: With dead ends: 663 [2023-12-15 21:30:02,284 INFO L226 Difference]: Without dead ends: 425 [2023-12-15 21:30:02,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:30:02,285 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 165 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:02,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 537 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-12-15 21:30:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 326. [2023-12-15 21:30:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 294 states have (on average 1.445578231292517) internal successors, (425), 294 states have internal predecessors, (425), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions. [2023-12-15 21:30:02,302 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 95 [2023-12-15 21:30:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:02,304 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 479 transitions. [2023-12-15 21:30:02,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions. [2023-12-15 21:30:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:30:02,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:02,304 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:02,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:30:02,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:02,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash 382938092, now seen corresponding path program 1 times [2023-12-15 21:30:02,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:02,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996620914] [2023-12-15 21:30:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996620914] [2023-12-15 21:30:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996620914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:02,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337024936] [2023-12-15 21:30:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:02,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:02,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:02,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:02,421 INFO L87 Difference]: Start difference. First operand 326 states and 479 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:02,463 INFO L93 Difference]: Finished difference Result 653 states and 967 transitions. [2023-12-15 21:30:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-12-15 21:30:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:02,465 INFO L225 Difference]: With dead ends: 653 [2023-12-15 21:30:02,466 INFO L226 Difference]: Without dead ends: 373 [2023-12-15 21:30:02,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:30:02,466 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 92 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 538 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-15 21:30:02,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 538 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-12-15 21:30:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 331. [2023-12-15 21:30:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.4381270903010033) internal successors, (430), 299 states have internal predecessors, (430), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 484 transitions. [2023-12-15 21:30:02,483 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 484 transitions. Word has length 95 [2023-12-15 21:30:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:02,484 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 484 transitions. [2023-12-15 21:30:02,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 484 transitions. [2023-12-15 21:30:02,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:30:02,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:02,485 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:02,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:30:02,485 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:02,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1344316439, now seen corresponding path program 1 times [2023-12-15 21:30:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:02,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010105462] [2023-12-15 21:30:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:02,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010105462] [2023-12-15 21:30:02,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010105462] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:02,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-15 21:30:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496196470] [2023-12-15 21:30:02,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:02,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:30:02,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:02,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:30:02,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:30:02,757 INFO L87 Difference]: Start difference. First operand 331 states and 484 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:03,497 INFO L93 Difference]: Finished difference Result 1163 states and 1723 transitions. [2023-12-15 21:30:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-15 21:30:03,497 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-12-15 21:30:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:03,500 INFO L225 Difference]: With dead ends: 1163 [2023-12-15 21:30:03,500 INFO L226 Difference]: Without dead ends: 878 [2023-12-15 21:30:03,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2023-12-15 21:30:03,501 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 649 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:03,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 2090 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:30:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2023-12-15 21:30:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 373. [2023-12-15 21:30:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 341 states have (on average 1.4633431085043989) internal successors, (499), 341 states have internal predecessors, (499), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 553 transitions. [2023-12-15 21:30:03,530 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 553 transitions. Word has length 95 [2023-12-15 21:30:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:03,530 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 553 transitions. [2023-12-15 21:30:03,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 553 transitions. [2023-12-15 21:30:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:30:03,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:03,531 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:03,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:30:03,531 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:03,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash 461121895, now seen corresponding path program 1 times [2023-12-15 21:30:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:03,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65847253] [2023-12-15 21:30:03,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:03,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65847253] [2023-12-15 21:30:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65847253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:03,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843325103] [2023-12-15 21:30:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:03,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:03,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:03,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:03,681 INFO L87 Difference]: Start difference. First operand 373 states and 553 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:03,766 INFO L93 Difference]: Finished difference Result 987 states and 1462 transitions. [2023-12-15 21:30:03,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:30:03,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-12-15 21:30:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:03,768 INFO L225 Difference]: With dead ends: 987 [2023-12-15 21:30:03,768 INFO L226 Difference]: Without dead ends: 660 [2023-12-15 21:30:03,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:30:03,770 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 171 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:03,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 895 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2023-12-15 21:30:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 405. [2023-12-15 21:30:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 373 states have (on average 1.4718498659517427) internal successors, (549), 373 states have internal predecessors, (549), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 603 transitions. [2023-12-15 21:30:03,798 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 603 transitions. Word has length 95 [2023-12-15 21:30:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:03,798 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 603 transitions. [2023-12-15 21:30:03,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 603 transitions. [2023-12-15 21:30:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:30:03,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:03,799 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:03,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:30:03,799 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:03,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash -549995355, now seen corresponding path program 1 times [2023-12-15 21:30:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:03,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88709995] [2023-12-15 21:30:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:03,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:04,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88709995] [2023-12-15 21:30:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88709995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:04,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:04,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-15 21:30:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118296867] [2023-12-15 21:30:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:04,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:30:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:30:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:30:04,078 INFO L87 Difference]: Start difference. First operand 405 states and 603 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:04,748 INFO L93 Difference]: Finished difference Result 1295 states and 1931 transitions. [2023-12-15 21:30:04,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-15 21:30:04,748 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-12-15 21:30:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:04,751 INFO L225 Difference]: With dead ends: 1295 [2023-12-15 21:30:04,751 INFO L226 Difference]: Without dead ends: 936 [2023-12-15 21:30:04,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:30:04,753 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 497 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:04,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2415 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:30:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2023-12-15 21:30:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 450. [2023-12-15 21:30:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 418 states have (on average 1.4784688995215312) internal successors, (618), 418 states have internal predecessors, (618), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 672 transitions. [2023-12-15 21:30:04,778 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 672 transitions. Word has length 95 [2023-12-15 21:30:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:04,778 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 672 transitions. [2023-12-15 21:30:04,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 672 transitions. [2023-12-15 21:30:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:30:04,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:04,779 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:04,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:30:04,779 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:04,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1184946382, now seen corresponding path program 1 times [2023-12-15 21:30:04,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:04,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825157429] [2023-12-15 21:30:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:05,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:05,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825157429] [2023-12-15 21:30:05,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825157429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:05,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-15 21:30:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072218312] [2023-12-15 21:30:05,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:05,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:30:05,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:30:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:30:05,079 INFO L87 Difference]: Start difference. First operand 450 states and 672 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:05,637 INFO L93 Difference]: Finished difference Result 1680 states and 2520 transitions. [2023-12-15 21:30:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:30:05,637 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-15 21:30:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:05,641 INFO L225 Difference]: With dead ends: 1680 [2023-12-15 21:30:05,641 INFO L226 Difference]: Without dead ends: 1270 [2023-12-15 21:30:05,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2023-12-15 21:30:05,643 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 528 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:05,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 2205 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:30:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2023-12-15 21:30:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 579. [2023-12-15 21:30:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 547 states have (on average 1.5082266910420474) internal successors, (825), 547 states have internal predecessors, (825), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 879 transitions. [2023-12-15 21:30:05,667 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 879 transitions. Word has length 96 [2023-12-15 21:30:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:05,668 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 879 transitions. [2023-12-15 21:30:05,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 879 transitions. [2023-12-15 21:30:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:30:05,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:05,668 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:05,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:30:05,669 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:05,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 261680488, now seen corresponding path program 1 times [2023-12-15 21:30:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935233711] [2023-12-15 21:30:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:05,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935233711] [2023-12-15 21:30:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935233711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:05,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:05,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 21:30:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389664675] [2023-12-15 21:30:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:05,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:30:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:05,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:30:05,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:30:05,881 INFO L87 Difference]: Start difference. First operand 579 states and 879 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:06,643 INFO L93 Difference]: Finished difference Result 2018 states and 3055 transitions. [2023-12-15 21:30:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-15 21:30:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-15 21:30:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:06,648 INFO L225 Difference]: With dead ends: 2018 [2023-12-15 21:30:06,648 INFO L226 Difference]: Without dead ends: 1485 [2023-12-15 21:30:06,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2023-12-15 21:30:06,651 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 668 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:06,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1962 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:30:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2023-12-15 21:30:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 603. [2023-12-15 21:30:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 571 states have (on average 1.5131348511383538) internal successors, (864), 571 states have internal predecessors, (864), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 918 transitions. [2023-12-15 21:30:06,683 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 918 transitions. Word has length 96 [2023-12-15 21:30:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:06,683 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 918 transitions. [2023-12-15 21:30:06,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 918 transitions. [2023-12-15 21:30:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:30:06,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:06,684 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:06,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:30:06,684 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:06,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -555967962, now seen corresponding path program 1 times [2023-12-15 21:30:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:06,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781985959] [2023-12-15 21:30:06,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781985959] [2023-12-15 21:30:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781985959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:06,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599522745] [2023-12-15 21:30:06,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:06,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:06,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:06,816 INFO L87 Difference]: Start difference. First operand 603 states and 918 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:07,098 INFO L93 Difference]: Finished difference Result 1659 states and 2517 transitions. [2023-12-15 21:30:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:30:07,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-15 21:30:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:07,101 INFO L225 Difference]: With dead ends: 1659 [2023-12-15 21:30:07,101 INFO L226 Difference]: Without dead ends: 1102 [2023-12-15 21:30:07,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:07,102 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 332 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:07,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1578 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2023-12-15 21:30:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 624. [2023-12-15 21:30:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 592 states have (on average 1.5202702702702702) internal successors, (900), 592 states have internal predecessors, (900), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:30:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 954 transitions. [2023-12-15 21:30:07,129 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 954 transitions. Word has length 96 [2023-12-15 21:30:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:07,132 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 954 transitions. [2023-12-15 21:30:07,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 954 transitions. [2023-12-15 21:30:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:30:07,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:07,133 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:07,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:30:07,133 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:07,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2062050126, now seen corresponding path program 1 times [2023-12-15 21:30:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:07,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418467660] [2023-12-15 21:30:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:07,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:07,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418467660] [2023-12-15 21:30:07,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418467660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:07,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:07,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:30:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747087107] [2023-12-15 21:30:07,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:30:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:07,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:30:07,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:07,372 INFO L87 Difference]: Start difference. First operand 624 states and 954 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:07,896 INFO L93 Difference]: Finished difference Result 1880 states and 2865 transitions. [2023-12-15 21:30:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:30:07,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-15 21:30:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:07,900 INFO L225 Difference]: With dead ends: 1880 [2023-12-15 21:30:07,900 INFO L226 Difference]: Without dead ends: 1302 [2023-12-15 21:30:07,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:30:07,901 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 348 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:07,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1301 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:30:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2023-12-15 21:30:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1256. [2023-12-15 21:30:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1186 states have (on average 1.5025295109612142) internal successors, (1782), 1190 states have internal predecessors, (1782), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-15 21:30:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1900 transitions. [2023-12-15 21:30:07,949 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1900 transitions. Word has length 96 [2023-12-15 21:30:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:07,949 INFO L495 AbstractCegarLoop]: Abstraction has 1256 states and 1900 transitions. [2023-12-15 21:30:07,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1900 transitions. [2023-12-15 21:30:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:30:07,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:07,951 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:07,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:30:07,951 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:07,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash -615423256, now seen corresponding path program 1 times [2023-12-15 21:30:07,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363158048] [2023-12-15 21:30:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:07,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363158048] [2023-12-15 21:30:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363158048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 21:30:08,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366659848] [2023-12-15 21:30:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:08,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:30:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:30:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:30:08,151 INFO L87 Difference]: Start difference. First operand 1256 states and 1900 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:08,853 INFO L93 Difference]: Finished difference Result 3582 states and 5377 transitions. [2023-12-15 21:30:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 21:30:08,853 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-15 21:30:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:08,861 INFO L225 Difference]: With dead ends: 3582 [2023-12-15 21:30:08,861 INFO L226 Difference]: Without dead ends: 2360 [2023-12-15 21:30:08,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2023-12-15 21:30:08,864 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 494 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:08,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2766 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:30:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2023-12-15 21:30:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1283. [2023-12-15 21:30:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1213 states have (on average 1.4987633965375102) internal successors, (1818), 1217 states have internal predecessors, (1818), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-15 21:30:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1936 transitions. [2023-12-15 21:30:08,943 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1936 transitions. Word has length 96 [2023-12-15 21:30:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:08,943 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1936 transitions. [2023-12-15 21:30:08,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1936 transitions. [2023-12-15 21:30:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:30:08,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:08,945 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:08,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:30:08,945 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:08,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1433071706, now seen corresponding path program 1 times [2023-12-15 21:30:08,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:08,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059844637] [2023-12-15 21:30:08,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:09,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059844637] [2023-12-15 21:30:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059844637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:09,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:09,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114744] [2023-12-15 21:30:09,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:09,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:09,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:09,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:09,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:09,070 INFO L87 Difference]: Start difference. First operand 1283 states and 1936 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:09,380 INFO L93 Difference]: Finished difference Result 3158 states and 4734 transitions. [2023-12-15 21:30:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:30:09,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-15 21:30:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:09,385 INFO L225 Difference]: With dead ends: 3158 [2023-12-15 21:30:09,386 INFO L226 Difference]: Without dead ends: 1909 [2023-12-15 21:30:09,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:09,388 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 291 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:09,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1594 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2023-12-15 21:30:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1274. [2023-12-15 21:30:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1204 states have (on average 1.495016611295681) internal successors, (1800), 1208 states have internal predecessors, (1800), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-15 21:30:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1918 transitions. [2023-12-15 21:30:09,449 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1918 transitions. Word has length 96 [2023-12-15 21:30:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:09,450 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1918 transitions. [2023-12-15 21:30:09,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1918 transitions. [2023-12-15 21:30:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:30:09,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:09,451 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:09,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:30:09,451 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:09,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash -61241794, now seen corresponding path program 1 times [2023-12-15 21:30:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:09,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636045517] [2023-12-15 21:30:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:09,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636045517] [2023-12-15 21:30:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636045517] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:09,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:30:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664222586] [2023-12-15 21:30:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:09,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:30:09,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:09,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:30:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:09,655 INFO L87 Difference]: Start difference. First operand 1274 states and 1918 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:10,174 INFO L93 Difference]: Finished difference Result 3106 states and 4655 transitions. [2023-12-15 21:30:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:30:10,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-15 21:30:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:10,179 INFO L225 Difference]: With dead ends: 3106 [2023-12-15 21:30:10,179 INFO L226 Difference]: Without dead ends: 1878 [2023-12-15 21:30:10,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:30:10,181 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 395 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:10,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1608 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:30:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2023-12-15 21:30:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1229. [2023-12-15 21:30:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1159 states have (on average 1.4779982743744609) internal successors, (1713), 1163 states have internal predecessors, (1713), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-15 21:30:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1831 transitions. [2023-12-15 21:30:10,238 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1831 transitions. Word has length 96 [2023-12-15 21:30:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:10,238 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1831 transitions. [2023-12-15 21:30:10,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1831 transitions. [2023-12-15 21:30:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 21:30:10,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:10,240 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:10,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 21:30:10,240 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:10,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1356318099, now seen corresponding path program 1 times [2023-12-15 21:30:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:10,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598504623] [2023-12-15 21:30:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598504623] [2023-12-15 21:30:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598504623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:10,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:30:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619717434] [2023-12-15 21:30:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:10,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:30:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:30:10,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:30:10,375 INFO L87 Difference]: Start difference. First operand 1229 states and 1831 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:10,478 INFO L93 Difference]: Finished difference Result 2270 states and 3393 transitions. [2023-12-15 21:30:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:30:10,478 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-12-15 21:30:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:10,481 INFO L225 Difference]: With dead ends: 2270 [2023-12-15 21:30:10,481 INFO L226 Difference]: Without dead ends: 1087 [2023-12-15 21:30:10,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:30:10,484 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:10,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 327 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2023-12-15 21:30:10,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1085. [2023-12-15 21:30:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1026 states have (on average 1.4814814814814814) internal successors, (1520), 1029 states have internal predecessors, (1520), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 21:30:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1620 transitions. [2023-12-15 21:30:10,524 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1620 transitions. Word has length 97 [2023-12-15 21:30:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:10,525 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1620 transitions. [2023-12-15 21:30:10,525 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1620 transitions. [2023-12-15 21:30:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 21:30:10,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:10,527 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:10,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 21:30:10,527 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:10,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1648450927, now seen corresponding path program 1 times [2023-12-15 21:30:10,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:10,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111214524] [2023-12-15 21:30:10,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:10,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:10,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111214524] [2023-12-15 21:30:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111214524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:10,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218440712] [2023-12-15 21:30:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:10,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:10,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:10,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:10,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:10,651 INFO L87 Difference]: Start difference. First operand 1085 states and 1620 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:10,970 INFO L93 Difference]: Finished difference Result 3036 states and 4518 transitions. [2023-12-15 21:30:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:30:10,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-12-15 21:30:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:10,975 INFO L225 Difference]: With dead ends: 3036 [2023-12-15 21:30:10,975 INFO L226 Difference]: Without dead ends: 1997 [2023-12-15 21:30:10,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:10,977 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 316 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:10,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1700 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2023-12-15 21:30:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1086. [2023-12-15 21:30:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1027 states have (on average 1.4819863680623175) internal successors, (1522), 1030 states have internal predecessors, (1522), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 21:30:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1622 transitions. [2023-12-15 21:30:11,023 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1622 transitions. Word has length 97 [2023-12-15 21:30:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:11,023 INFO L495 AbstractCegarLoop]: Abstraction has 1086 states and 1622 transitions. [2023-12-15 21:30:11,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1622 transitions. [2023-12-15 21:30:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 21:30:11,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:11,024 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:11,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 21:30:11,024 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:11,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1710490541, now seen corresponding path program 1 times [2023-12-15 21:30:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:11,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476586987] [2023-12-15 21:30:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:11,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476586987] [2023-12-15 21:30:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476586987] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:30:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986159070] [2023-12-15 21:30:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:11,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:30:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:30:11,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:30:11,143 INFO L87 Difference]: Start difference. First operand 1086 states and 1622 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:11,225 INFO L93 Difference]: Finished difference Result 2128 states and 3183 transitions. [2023-12-15 21:30:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:30:11,226 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-12-15 21:30:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:11,229 INFO L225 Difference]: With dead ends: 2128 [2023-12-15 21:30:11,229 INFO L226 Difference]: Without dead ends: 1088 [2023-12-15 21:30:11,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-15 21:30:11,231 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 137 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:11,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 353 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-12-15 21:30:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1043. [2023-12-15 21:30:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 984 states have (on average 1.4684959349593496) internal successors, (1445), 987 states have internal predecessors, (1445), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 21:30:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1545 transitions. [2023-12-15 21:30:11,271 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1545 transitions. Word has length 97 [2023-12-15 21:30:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:11,272 INFO L495 AbstractCegarLoop]: Abstraction has 1043 states and 1545 transitions. [2023-12-15 21:30:11,272 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1545 transitions. [2023-12-15 21:30:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:11,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:11,273 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:11,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 21:30:11,273 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:11,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash 973826922, now seen corresponding path program 1 times [2023-12-15 21:30:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361846935] [2023-12-15 21:30:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361846935] [2023-12-15 21:30:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361846935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:11,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:11,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:30:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648887032] [2023-12-15 21:30:11,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:11,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:30:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:30:11,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:11,440 INFO L87 Difference]: Start difference. First operand 1043 states and 1545 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:11,957 INFO L93 Difference]: Finished difference Result 3362 states and 5052 transitions. [2023-12-15 21:30:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:30:11,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:11,969 INFO L225 Difference]: With dead ends: 3362 [2023-12-15 21:30:11,969 INFO L226 Difference]: Without dead ends: 2357 [2023-12-15 21:30:11,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:30:11,971 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 408 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:11,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1755 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:30:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2023-12-15 21:30:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1490. [2023-12-15 21:30:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1411 states have (on average 1.4705882352941178) internal successors, (2075), 1414 states have internal predecessors, (2075), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2211 transitions. [2023-12-15 21:30:12,037 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2211 transitions. Word has length 98 [2023-12-15 21:30:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:12,037 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 2211 transitions. [2023-12-15 21:30:12,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2211 transitions. [2023-12-15 21:30:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:12,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:12,038 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:12,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 21:30:12,038 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:12,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:12,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1396528748, now seen corresponding path program 1 times [2023-12-15 21:30:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:12,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117041529] [2023-12-15 21:30:12,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:12,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117041529] [2023-12-15 21:30:12,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117041529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:12,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:12,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431770478] [2023-12-15 21:30:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:12,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:12,240 INFO L87 Difference]: Start difference. First operand 1490 states and 2211 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:12,595 INFO L93 Difference]: Finished difference Result 3197 states and 4707 transitions. [2023-12-15 21:30:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:30:12,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:12,601 INFO L225 Difference]: With dead ends: 3197 [2023-12-15 21:30:12,602 INFO L226 Difference]: Without dead ends: 2475 [2023-12-15 21:30:12,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:30:12,603 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 281 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:12,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1699 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2023-12-15 21:30:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1463. [2023-12-15 21:30:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1384 states have (on average 1.4754335260115607) internal successors, (2042), 1387 states have internal predecessors, (2042), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2178 transitions. [2023-12-15 21:30:12,665 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2178 transitions. Word has length 98 [2023-12-15 21:30:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:12,666 INFO L495 AbstractCegarLoop]: Abstraction has 1463 states and 2178 transitions. [2023-12-15 21:30:12,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2178 transitions. [2023-12-15 21:30:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:12,666 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:12,666 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:12,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 21:30:12,667 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:12,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -975210514, now seen corresponding path program 1 times [2023-12-15 21:30:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57073016] [2023-12-15 21:30:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:13,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57073016] [2023-12-15 21:30:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57073016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:30:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356437406] [2023-12-15 21:30:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:13,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:30:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:30:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:13,004 INFO L87 Difference]: Start difference. First operand 1463 states and 2178 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:13,557 INFO L93 Difference]: Finished difference Result 2591 states and 3807 transitions. [2023-12-15 21:30:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:30:13,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:13,572 INFO L225 Difference]: With dead ends: 2591 [2023-12-15 21:30:13,572 INFO L226 Difference]: Without dead ends: 1869 [2023-12-15 21:30:13,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:13,573 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 481 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:13,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1422 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:30:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2023-12-15 21:30:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1455. [2023-12-15 21:30:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1376 states have (on average 1.4738372093023255) internal successors, (2028), 1379 states have internal predecessors, (2028), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2164 transitions. [2023-12-15 21:30:13,637 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2164 transitions. Word has length 98 [2023-12-15 21:30:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:13,637 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 2164 transitions. [2023-12-15 21:30:13,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2164 transitions. [2023-12-15 21:30:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:13,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:13,638 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:13,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 21:30:13,638 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:13,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash -621702097, now seen corresponding path program 1 times [2023-12-15 21:30:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:13,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571826636] [2023-12-15 21:30:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571826636] [2023-12-15 21:30:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571826636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:13,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:13,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:30:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536702367] [2023-12-15 21:30:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:13,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:30:13,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:30:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:30:13,736 INFO L87 Difference]: Start difference. First operand 1455 states and 2164 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:13,905 INFO L93 Difference]: Finished difference Result 3211 states and 4784 transitions. [2023-12-15 21:30:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:30:13,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:13,909 INFO L225 Difference]: With dead ends: 3211 [2023-12-15 21:30:13,909 INFO L226 Difference]: Without dead ends: 1802 [2023-12-15 21:30:13,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:13,911 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 140 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:13,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 535 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2023-12-15 21:30:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1464. [2023-12-15 21:30:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1385 states have (on average 1.4541516245487365) internal successors, (2014), 1388 states have internal predecessors, (2014), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2150 transitions. [2023-12-15 21:30:13,966 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2150 transitions. Word has length 98 [2023-12-15 21:30:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:13,966 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 2150 transitions. [2023-12-15 21:30:13,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2150 transitions. [2023-12-15 21:30:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:13,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:13,968 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:13,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-15 21:30:13,968 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:13,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1528509846, now seen corresponding path program 1 times [2023-12-15 21:30:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308012702] [2023-12-15 21:30:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308012702] [2023-12-15 21:30:14,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308012702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:14,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:14,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:30:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655297103] [2023-12-15 21:30:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:14,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:30:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:30:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:14,140 INFO L87 Difference]: Start difference. First operand 1464 states and 2150 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:14,544 INFO L93 Difference]: Finished difference Result 4597 states and 6719 transitions. [2023-12-15 21:30:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:30:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:14,550 INFO L225 Difference]: With dead ends: 4597 [2023-12-15 21:30:14,550 INFO L226 Difference]: Without dead ends: 3179 [2023-12-15 21:30:14,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:30:14,553 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 760 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:14,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1050 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2023-12-15 21:30:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 1548. [2023-12-15 21:30:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1469 states have (on average 1.4560925799863853) internal successors, (2139), 1472 states have internal predecessors, (2139), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2275 transitions. [2023-12-15 21:30:14,618 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2275 transitions. Word has length 98 [2023-12-15 21:30:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:14,618 INFO L495 AbstractCegarLoop]: Abstraction has 1548 states and 2275 transitions. [2023-12-15 21:30:14,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2275 transitions. [2023-12-15 21:30:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:14,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:14,619 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:14,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-15 21:30:14,619 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:14,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1745389096, now seen corresponding path program 1 times [2023-12-15 21:30:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431063126] [2023-12-15 21:30:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431063126] [2023-12-15 21:30:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431063126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:14,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:14,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:14,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030420668] [2023-12-15 21:30:14,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:14,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:14,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:14,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:14,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:14,891 INFO L87 Difference]: Start difference. First operand 1548 states and 2275 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:15,265 INFO L93 Difference]: Finished difference Result 3263 states and 4798 transitions. [2023-12-15 21:30:15,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:30:15,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:15,268 INFO L225 Difference]: With dead ends: 3263 [2023-12-15 21:30:15,268 INFO L226 Difference]: Without dead ends: 1761 [2023-12-15 21:30:15,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:30:15,270 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 326 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:15,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 878 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2023-12-15 21:30:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1527. [2023-12-15 21:30:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1448 states have (on average 1.4564917127071824) internal successors, (2109), 1451 states have internal predecessors, (2109), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2245 transitions. [2023-12-15 21:30:15,337 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2245 transitions. Word has length 98 [2023-12-15 21:30:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:15,337 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 2245 transitions. [2023-12-15 21:30:15,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2245 transitions. [2023-12-15 21:30:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:15,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:15,338 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:15,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-15 21:30:15,338 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:15,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1105808020, now seen corresponding path program 1 times [2023-12-15 21:30:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39829992] [2023-12-15 21:30:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:15,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:15,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39829992] [2023-12-15 21:30:15,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39829992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:15,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:15,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631635928] [2023-12-15 21:30:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:15,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:15,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:15,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:15,498 INFO L87 Difference]: Start difference. First operand 1527 states and 2245 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:15,867 INFO L93 Difference]: Finished difference Result 3844 states and 5616 transitions. [2023-12-15 21:30:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:30:15,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:15,871 INFO L225 Difference]: With dead ends: 3844 [2023-12-15 21:30:15,871 INFO L226 Difference]: Without dead ends: 2345 [2023-12-15 21:30:15,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:30:15,873 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 359 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:15,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1111 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2023-12-15 21:30:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1507. [2023-12-15 21:30:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1428 states have (on average 1.449579831932773) internal successors, (2070), 1431 states have internal predecessors, (2070), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2206 transitions. [2023-12-15 21:30:15,935 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2206 transitions. Word has length 98 [2023-12-15 21:30:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:15,936 INFO L495 AbstractCegarLoop]: Abstraction has 1507 states and 2206 transitions. [2023-12-15 21:30:15,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2206 transitions. [2023-12-15 21:30:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:15,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:15,937 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:15,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-15 21:30:15,937 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:15,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2126876374, now seen corresponding path program 1 times [2023-12-15 21:30:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545093531] [2023-12-15 21:30:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:16,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:16,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545093531] [2023-12-15 21:30:16,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545093531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:16,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:16,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:16,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454982419] [2023-12-15 21:30:16,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:16,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:16,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:16,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:16,169 INFO L87 Difference]: Start difference. First operand 1507 states and 2206 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:16,698 INFO L93 Difference]: Finished difference Result 2549 states and 3706 transitions. [2023-12-15 21:30:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:30:16,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:16,703 INFO L225 Difference]: With dead ends: 2549 [2023-12-15 21:30:16,703 INFO L226 Difference]: Without dead ends: 1781 [2023-12-15 21:30:16,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:30:16,705 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 463 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:16,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1505 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:30:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2023-12-15 21:30:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1504. [2023-12-15 21:30:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1425 states have (on average 1.447719298245614) internal successors, (2063), 1428 states have internal predecessors, (2063), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2199 transitions. [2023-12-15 21:30:16,765 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2199 transitions. Word has length 98 [2023-12-15 21:30:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:16,767 INFO L495 AbstractCegarLoop]: Abstraction has 1504 states and 2199 transitions. [2023-12-15 21:30:16,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2199 transitions. [2023-12-15 21:30:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:30:16,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:16,771 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:16,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-15 21:30:16,772 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:16,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1326939985, now seen corresponding path program 1 times [2023-12-15 21:30:16,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:16,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98967869] [2023-12-15 21:30:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:16,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:16,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98967869] [2023-12-15 21:30:16,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98967869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:16,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:16,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:30:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865253978] [2023-12-15 21:30:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:16,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:30:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:30:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:30:16,920 INFO L87 Difference]: Start difference. First operand 1504 states and 2199 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:17,211 INFO L93 Difference]: Finished difference Result 3420 states and 4993 transitions. [2023-12-15 21:30:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:30:17,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-15 21:30:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:17,214 INFO L225 Difference]: With dead ends: 3420 [2023-12-15 21:30:17,214 INFO L226 Difference]: Without dead ends: 1962 [2023-12-15 21:30:17,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:30:17,216 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 332 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:17,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1228 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:17,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2023-12-15 21:30:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1491. [2023-12-15 21:30:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1412 states have (on average 1.428470254957507) internal successors, (2017), 1415 states have internal predecessors, (2017), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2153 transitions. [2023-12-15 21:30:17,273 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2153 transitions. Word has length 98 [2023-12-15 21:30:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:17,274 INFO L495 AbstractCegarLoop]: Abstraction has 1491 states and 2153 transitions. [2023-12-15 21:30:17,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2153 transitions. [2023-12-15 21:30:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:30:17,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:17,275 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:17,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-15 21:30:17,275 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:17,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash 184072389, now seen corresponding path program 1 times [2023-12-15 21:30:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168693548] [2023-12-15 21:30:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:17,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:17,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168693548] [2023-12-15 21:30:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168693548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:17,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:17,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:17,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190630820] [2023-12-15 21:30:17,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:17,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:17,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:17,356 INFO L87 Difference]: Start difference. First operand 1491 states and 2153 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:17,445 INFO L93 Difference]: Finished difference Result 3034 states and 4377 transitions. [2023-12-15 21:30:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:17,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2023-12-15 21:30:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:17,449 INFO L225 Difference]: With dead ends: 3034 [2023-12-15 21:30:17,449 INFO L226 Difference]: Without dead ends: 1589 [2023-12-15 21:30:17,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:30:17,453 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 517 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-15 21:30:17,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 517 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2023-12-15 21:30:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1512. [2023-12-15 21:30:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1433 states have (on average 1.4221912072575018) internal successors, (2038), 1436 states have internal predecessors, (2038), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:30:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2174 transitions. [2023-12-15 21:30:17,514 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2174 transitions. Word has length 99 [2023-12-15 21:30:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:17,514 INFO L495 AbstractCegarLoop]: Abstraction has 1512 states and 2174 transitions. [2023-12-15 21:30:17,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2174 transitions. [2023-12-15 21:30:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:30:17,515 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:17,515 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-15 21:30:17,516 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:17,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1637021750, now seen corresponding path program 1 times [2023-12-15 21:30:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555329118] [2023-12-15 21:30:17,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555329118] [2023-12-15 21:30:17,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555329118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:17,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:17,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:30:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501185293] [2023-12-15 21:30:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:17,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:30:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:17,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:30:17,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:17,785 INFO L87 Difference]: Start difference. First operand 1512 states and 2174 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:18,027 INFO L93 Difference]: Finished difference Result 2965 states and 4275 transitions. [2023-12-15 21:30:18,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:30:18,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2023-12-15 21:30:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:18,030 INFO L225 Difference]: With dead ends: 2965 [2023-12-15 21:30:18,030 INFO L226 Difference]: Without dead ends: 1487 [2023-12-15 21:30:18,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:18,031 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 378 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:18,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 770 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2023-12-15 21:30:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 823. [2023-12-15 21:30:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 764 states have (on average 1.399214659685864) internal successors, (1069), 767 states have internal predecessors, (1069), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 21:30:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1169 transitions. [2023-12-15 21:30:18,074 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1169 transitions. Word has length 99 [2023-12-15 21:30:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:18,074 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1169 transitions. [2023-12-15 21:30:18,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1169 transitions. [2023-12-15 21:30:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:30:18,074 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:18,074 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:18,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-15 21:30:18,075 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:18,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 563864886, now seen corresponding path program 1 times [2023-12-15 21:30:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:18,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847982530] [2023-12-15 21:30:18,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847982530] [2023-12-15 21:30:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847982530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:18,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:18,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:30:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827047464] [2023-12-15 21:30:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:18,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:30:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:18,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:30:18,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:18,326 INFO L87 Difference]: Start difference. First operand 823 states and 1169 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:18,739 INFO L93 Difference]: Finished difference Result 1917 states and 2730 transitions. [2023-12-15 21:30:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:30:18,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2023-12-15 21:30:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:18,741 INFO L225 Difference]: With dead ends: 1917 [2023-12-15 21:30:18,741 INFO L226 Difference]: Without dead ends: 1140 [2023-12-15 21:30:18,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:30:18,742 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 249 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:18,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1341 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:30:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-12-15 21:30:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 821. [2023-12-15 21:30:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 762 states have (on average 1.3871391076115485) internal successors, (1057), 765 states have internal predecessors, (1057), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 21:30:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1157 transitions. [2023-12-15 21:30:18,784 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1157 transitions. Word has length 99 [2023-12-15 21:30:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:18,784 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1157 transitions. [2023-12-15 21:30:18,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1157 transitions. [2023-12-15 21:30:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 21:30:18,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:18,785 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:18,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-15 21:30:18,785 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:18,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 986566712, now seen corresponding path program 1 times [2023-12-15 21:30:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327373525] [2023-12-15 21:30:18,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:18,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327373525] [2023-12-15 21:30:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327373525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:18,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:30:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179772970] [2023-12-15 21:30:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:18,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:30:18,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:18,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:30:18,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:30:18,979 INFO L87 Difference]: Start difference. First operand 821 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:19,167 INFO L93 Difference]: Finished difference Result 1382 states and 1971 transitions. [2023-12-15 21:30:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:30:19,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2023-12-15 21:30:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:19,169 INFO L225 Difference]: With dead ends: 1382 [2023-12-15 21:30:19,169 INFO L226 Difference]: Without dead ends: 607 [2023-12-15 21:30:19,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:19,170 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 255 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:19,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 519 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-12-15 21:30:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 574. [2023-12-15 21:30:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 526 states have (on average 1.414448669201521) internal successors, (744), 528 states have internal predecessors, (744), 41 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-15 21:30:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 826 transitions. [2023-12-15 21:30:19,203 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 826 transitions. Word has length 99 [2023-12-15 21:30:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:19,203 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 826 transitions. [2023-12-15 21:30:19,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 826 transitions. [2023-12-15 21:30:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 21:30:19,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:19,204 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:19,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-15 21:30:19,204 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:19,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash 324209674, now seen corresponding path program 1 times [2023-12-15 21:30:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199595378] [2023-12-15 21:30:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199595378] [2023-12-15 21:30:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199595378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:19,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:30:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335851327] [2023-12-15 21:30:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:19,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:30:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:30:19,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:30:19,450 INFO L87 Difference]: Start difference. First operand 574 states and 826 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:19,690 INFO L93 Difference]: Finished difference Result 1272 states and 1819 transitions. [2023-12-15 21:30:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:30:19,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2023-12-15 21:30:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:19,692 INFO L225 Difference]: With dead ends: 1272 [2023-12-15 21:30:19,692 INFO L226 Difference]: Without dead ends: 744 [2023-12-15 21:30:19,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:30:19,693 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 291 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:19,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 944 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2023-12-15 21:30:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 636. [2023-12-15 21:30:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 587 states have (on average 1.405451448040886) internal successors, (825), 589 states have internal predecessors, (825), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-15 21:30:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 907 transitions. [2023-12-15 21:30:19,736 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 907 transitions. Word has length 101 [2023-12-15 21:30:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:19,736 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 907 transitions. [2023-12-15 21:30:19,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 907 transitions. [2023-12-15 21:30:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 21:30:19,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:19,737 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:19,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-15 21:30:19,737 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:19,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash 266891790, now seen corresponding path program 1 times [2023-12-15 21:30:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:19,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103901376] [2023-12-15 21:30:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:30:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:30:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:20,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:20,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103901376] [2023-12-15 21:30:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103901376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:30:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962095072] [2023-12-15 21:30:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:20,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:30:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:30:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:30:20,100 INFO L87 Difference]: Start difference. First operand 636 states and 907 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:20,319 INFO L93 Difference]: Finished difference Result 645 states and 916 transitions. [2023-12-15 21:30:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:30:20,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2023-12-15 21:30:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:20,321 INFO L225 Difference]: With dead ends: 645 [2023-12-15 21:30:20,321 INFO L226 Difference]: Without dead ends: 643 [2023-12-15 21:30:20,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:30:20,321 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 311 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:20,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 725 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2023-12-15 21:30:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 640. [2023-12-15 21:30:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 591 states have (on average 1.4027072758037225) internal successors, (829), 593 states have internal predecessors, (829), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-15 21:30:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 911 transitions. [2023-12-15 21:30:20,357 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 911 transitions. Word has length 101 [2023-12-15 21:30:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:20,357 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 911 transitions. [2023-12-15 21:30:20,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 911 transitions. [2023-12-15 21:30:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 21:30:20,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:20,358 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:20,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-15 21:30:20,358 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:20,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 266951372, now seen corresponding path program 1 times [2023-12-15 21:30:20,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:20,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091119914] [2023-12-15 21:30:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:30:20,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:30:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:30:20,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:30:20,456 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:30:20,457 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:30:20,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-15 21:30:20,462 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:20,465 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:30:20,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:30:20 BoogieIcfgContainer [2023-12-15 21:30:20,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:30:20,553 INFO L158 Benchmark]: Toolchain (without parser) took 24881.00ms. Allocated memory was 337.6MB in the beginning and 813.7MB in the end (delta: 476.1MB). Free memory was 294.0MB in the beginning and 770.5MB in the end (delta: -476.5MB). Peak memory consumption was 483.5MB. Max. memory is 8.0GB. [2023-12-15 21:30:20,553 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 213.9MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:30:20,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.81ms. Allocated memory is still 337.6MB. Free memory was 293.7MB in the beginning and 279.3MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 21:30:20,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.92ms. Allocated memory is still 337.6MB. Free memory was 279.3MB in the beginning and 274.5MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:30:20,554 INFO L158 Benchmark]: Boogie Preprocessor took 83.69ms. Allocated memory is still 337.6MB. Free memory was 274.5MB in the beginning and 269.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:30:20,554 INFO L158 Benchmark]: RCFGBuilder took 627.52ms. Allocated memory is still 337.6MB. Free memory was 269.3MB in the beginning and 295.4MB in the end (delta: -26.1MB). Peak memory consumption was 34.8MB. Max. memory is 8.0GB. [2023-12-15 21:30:20,554 INFO L158 Benchmark]: TraceAbstraction took 23846.84ms. Allocated memory was 337.6MB in the beginning and 813.7MB in the end (delta: 476.1MB). Free memory was 294.9MB in the beginning and 770.5MB in the end (delta: -475.6MB). Peak memory consumption was 483.3MB. Max. memory is 8.0GB. [2023-12-15 21:30:20,554 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.43ms. Allocated memory is still 213.9MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.81ms. Allocated memory is still 337.6MB. Free memory was 293.7MB in the beginning and 279.3MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.92ms. Allocated memory is still 337.6MB. Free memory was 279.3MB in the beginning and 274.5MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.69ms. Allocated memory is still 337.6MB. Free memory was 274.5MB in the beginning and 269.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 627.52ms. Allocated memory is still 337.6MB. Free memory was 269.3MB in the beginning and 295.4MB in the end (delta: -26.1MB). Peak memory consumption was 34.8MB. Max. memory is 8.0GB. * TraceAbstraction took 23846.84ms. Allocated memory was 337.6MB in the beginning and 813.7MB in the end (delta: 476.1MB). Free memory was 294.9MB in the beginning and 770.5MB in the end (delta: -475.6MB). Peak memory consumption was 483.3MB. 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 someBinaryFLOATComparisonOperation at line 87, overapproximation of someUnaryDOUBLEoperation at line 26. 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] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -8; [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L84] EXPR signed_long_int_Array_0[0] [L84] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] float_Array_0[0] = __VERIFIER_nondet_float() [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] float_Array_0[2] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[2] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L73] EXPR float_Array_0[2] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] float_Array_0[3] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[3] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F [L75] EXPR float_Array_0[3] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L41] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L41] COND FALSE !(signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) [L44] EXPR unsigned_char_Array_0[1] [L44] signed_long_int_Array_0[1] = unsigned_char_Array_0[1] [L45] EXPR unsigned_char_Array_0[1] [L45] unsigned char stepLocal_1 = unsigned_char_Array_0[1]; [L46] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L46] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L47] EXPR unsigned_char_Array_0[0] [L47] signed_long_int_Array_0[0] = unsigned_char_Array_0[0] [L55] EXPR float_Array_0[3] [L55] float_Array_0[4] = float_Array_0[3] [L56] EXPR signed_long_int_Array_0[0] [L56] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] EXPR signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=200, unsigned_char_Array_0={8:0}] [L56] EXPR signed_long_int_Array_0[1] [L56] signed long int stepLocal_0 = (signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]; [L57] COND FALSE !(stepLocal_0 < -1) [L60] EXPR unsigned_char_Array_0[1] [L60] EXPR unsigned_char_Array_0[1] [L60] signed_short_int_Array_0[1] = (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) [L62] EXPR unsigned_char_Array_0[1] [L62] EXPR signed_long_int_Array_0[0] [L62] EXPR unsigned_char_Array_0[1] [L62] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L62] EXPR unsigned_char_Array_0[1] | signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=400, stepLocal_1=200, unsigned_char_Array_0={8:0}] [L62] EXPR signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=400, stepLocal_1=200, unsigned_char_Array_0={8:0}] [L62] COND FALSE !(unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])))) [L87] EXPR signed_short_int_Array_0[1] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR (((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1) [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1 [L87] EXPR (signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1) [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[1] | signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1 [L87] EXPR (unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1])))) [L87] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))) [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[0] [L87] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3])) [L87] EXPR float_Array_0[4] [L87] EXPR float_Array_0[3] [L87] EXPR (((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87-L88] return ((((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 40, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11875 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11874 mSDsluCounter, 44029 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36249 mSDsCounter, 664 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14628 IncrementalHoareTripleChecker+Invalid, 15292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 664 mSolverCounterUnsat, 7780 mSDtfsCounter, 14628 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1442 GetRequests, 1000 SyntacticMatches, 0 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1548occurred in iteration=29, InterpolantAutomatonStates: 403, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 14720 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3951 NumberOfCodeBlocks, 3951 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3902 ConstructedInterpolants, 0 QuantifiedInterpolants, 13539 SizeOfPredicates, 10 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 41 InterpolantComputations, 38 PerfectInterpolantSequences, 5877/5904 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-15 21:30:20,572 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...