/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:18:09,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:18:09,176 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-16 04:18:09,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:18:09,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:18:09,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:18:09,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:18:09,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:18:09,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:18:09,207 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:18:09,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:18:09,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:18:09,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:18:09,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:18:09,214 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:18:09,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:18:09,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:18:09,215 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:18:09,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:18:09,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:18:09,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:18:09,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:18:09,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:18:09,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:18:09,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:18:09,216 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:18:09,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:18:09,217 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:18:09,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:18:09,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:18:09,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:18:09,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:18:09,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:09,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:18:09,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:18:09,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:18:09,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:18:09,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:18:09,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:18:09,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:18:09,219 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:18:09,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:18:09,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:18:09,220 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:18:09,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:18:09,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:18:09,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:18:09,464 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:18:09,464 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:18:09,465 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-15.i [2023-12-16 04:18:10,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:18:10,920 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:18:10,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-12-16 04:18:10,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e752891/bb88799ab0994ff5b66c32b3eeb69487/FLAGac5855a1b [2023-12-16 04:18:10,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e752891/bb88799ab0994ff5b66c32b3eeb69487 [2023-12-16 04:18:10,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:18:10,947 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:18:10,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:10,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:18:10,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:18:10,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:10" (1/1) ... [2023-12-16 04:18:10,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45668f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:10, skipping insertion in model container [2023-12-16 04:18:10,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:10" (1/1) ... [2023-12-16 04:18:10,983 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:18:11,076 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-15.i[916,929] [2023-12-16 04:18:11,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:11,137 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:18:11,145 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-15.i[916,929] [2023-12-16 04:18:11,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:11,190 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:18:11,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11 WrapperNode [2023-12-16 04:18:11,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:11,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:11,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:18:11,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:18:11,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,266 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2023-12-16 04:18:11,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:11,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:18:11,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:18:11,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:18:11,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,310 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2023-12-16 04:18:11,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:18:11,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:18:11,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:18:11,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:18:11,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (1/1) ... [2023-12-16 04:18:11,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:11,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:11,362 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-16 04:18:11,364 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-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:18:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:18:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:18:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:18:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:18:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:18:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:18:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:18:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:18:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:18:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:18:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:18:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-16 04:18:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:18:11,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:18:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:18:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:18:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:18:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:18:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:18:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:18:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:18:11,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:18:11,487 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:18:11,489 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:18:11,895 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:18:11,945 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:18:11,945 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:18:11,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:11 BoogieIcfgContainer [2023-12-16 04:18:11,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:18:11,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:18:11,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:18:11,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:18:11,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:18:10" (1/3) ... [2023-12-16 04:18:11,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23739c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:11, skipping insertion in model container [2023-12-16 04:18:11,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:11" (2/3) ... [2023-12-16 04:18:11,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23739c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:11, skipping insertion in model container [2023-12-16 04:18:11,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:11" (3/3) ... [2023-12-16 04:18:11,952 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2023-12-16 04:18:11,966 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:18:11,966 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:18:12,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:18:12,018 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;@755a4115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:18:12,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:18:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:18:12,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:12,036 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:12,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:12,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1666154856, now seen corresponding path program 1 times [2023-12-16 04:18:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704044162] [2023-12-16 04:18:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:12,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704044162] [2023-12-16 04:18:12,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704044162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:18:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245176617] [2023-12-16 04:18:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:12,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:18:12,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:12,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:18:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:18:12,456 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:12,508 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-12-16 04:18:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:18:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-16 04:18:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:12,517 INFO L225 Difference]: With dead ends: 209 [2023-12-16 04:18:12,518 INFO L226 Difference]: Without dead ends: 104 [2023-12-16 04:18:12,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:18:12,525 INFO L413 NwaCegarLoop]: 148 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, 148 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-16 04:18:12,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-16 04:18:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-16 04:18:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-16 04:18:12,563 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-12-16 04:18:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:12,563 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-16 04:18:12,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-16 04:18:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:18:12,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:12,567 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:12,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:18:12,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:12,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1359425398, now seen corresponding path program 1 times [2023-12-16 04:18:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160846379] [2023-12-16 04:18:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160846379] [2023-12-16 04:18:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160846379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:12,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:12,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413091745] [2023-12-16 04:18:12,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:12,838 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:12,897 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2023-12-16 04:18:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:12,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-16 04:18:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:12,900 INFO L225 Difference]: With dead ends: 213 [2023-12-16 04:18:12,900 INFO L226 Difference]: Without dead ends: 110 [2023-12-16 04:18:12,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:12,902 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 10 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:12,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 436 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-16 04:18:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2023-12-16 04:18:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-12-16 04:18:12,910 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2023-12-16 04:18:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:12,910 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-12-16 04:18:12,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-12-16 04:18:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:18:12,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:12,915 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:12,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:18:12,915 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:12,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash -627457972, now seen corresponding path program 1 times [2023-12-16 04:18:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323876805] [2023-12-16 04:18:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:13,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323876805] [2023-12-16 04:18:13,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323876805] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:13,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:18:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914728434] [2023-12-16 04:18:13,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:13,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:18:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:13,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:18:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:13,064 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:13,094 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2023-12-16 04:18:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:18:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-16 04:18:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:13,098 INFO L225 Difference]: With dead ends: 212 [2023-12-16 04:18:13,098 INFO L226 Difference]: Without dead ends: 107 [2023-12-16 04:18:13,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:13,102 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:13,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-16 04:18:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-16 04:18:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-12-16 04:18:13,110 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 110 [2023-12-16 04:18:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:13,111 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-12-16 04:18:13,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-12-16 04:18:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:18:13,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:13,112 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:13,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:18:13,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:13,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:13,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1673364618, now seen corresponding path program 1 times [2023-12-16 04:18:13,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:13,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381982522] [2023-12-16 04:18:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:13,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381982522] [2023-12-16 04:18:13,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381982522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:13,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:13,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:18:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637135403] [2023-12-16 04:18:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:13,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:18:13,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:13,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:18:13,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:13,255 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:13,282 INFO L93 Difference]: Finished difference Result 237 states and 344 transitions. [2023-12-16 04:18:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:18:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-16 04:18:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:13,285 INFO L225 Difference]: With dead ends: 237 [2023-12-16 04:18:13,285 INFO L226 Difference]: Without dead ends: 131 [2023-12-16 04:18:13,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:13,291 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:13,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-16 04:18:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-12-16 04:18:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-12-16 04:18:13,297 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 110 [2023-12-16 04:18:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:13,298 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-12-16 04:18:13,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-12-16 04:18:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:18:13,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:13,299 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:13,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:18:13,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:13,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:13,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1920538100, now seen corresponding path program 1 times [2023-12-16 04:18:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:13,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216053420] [2023-12-16 04:18:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216053420] [2023-12-16 04:18:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216053420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:13,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417122588] [2023-12-16 04:18:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:13,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:13,661 INFO L87 Difference]: Start difference. First operand 108 states and 156 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:13,767 INFO L93 Difference]: Finished difference Result 322 states and 464 transitions. [2023-12-16 04:18:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:13,768 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-16 04:18:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:13,770 INFO L225 Difference]: With dead ends: 322 [2023-12-16 04:18:13,770 INFO L226 Difference]: Without dead ends: 215 [2023-12-16 04:18:13,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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-16 04:18:13,771 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 166 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:13,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 826 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-16 04:18:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2023-12-16 04:18:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 169 states have internal predecessors, (236), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 04:18:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2023-12-16 04:18:13,793 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 110 [2023-12-16 04:18:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:13,793 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2023-12-16 04:18:13,793 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2023-12-16 04:18:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 04:18:13,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:13,795 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:13,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:18:13,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:13,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 968016930, now seen corresponding path program 1 times [2023-12-16 04:18:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:13,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875497535] [2023-12-16 04:18:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:14,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875497535] [2023-12-16 04:18:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875497535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648402371] [2023-12-16 04:18:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:14,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:14,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:14,057 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:14,104 INFO L93 Difference]: Finished difference Result 613 states and 887 transitions. [2023-12-16 04:18:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:14,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-12-16 04:18:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:14,107 INFO L225 Difference]: With dead ends: 613 [2023-12-16 04:18:14,107 INFO L226 Difference]: Without dead ends: 423 [2023-12-16 04:18:14,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-16 04:18:14,109 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 176 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:14,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 449 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-16 04:18:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 373. [2023-12-16 04:18:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 328 states have (on average 1.4054878048780488) internal successors, (461), 330 states have internal predecessors, (461), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-16 04:18:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 541 transitions. [2023-12-16 04:18:14,132 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 541 transitions. Word has length 111 [2023-12-16 04:18:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:14,133 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 541 transitions. [2023-12-16 04:18:14,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 541 transitions. [2023-12-16 04:18:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:18:14,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:14,139 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:14,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:18:14,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:14,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:14,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1986392456, now seen corresponding path program 1 times [2023-12-16 04:18:14,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:14,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847909116] [2023-12-16 04:18:14,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:14,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:14,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:14,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847909116] [2023-12-16 04:18:14,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847909116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:14,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157519642] [2023-12-16 04:18:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:14,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:14,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:14,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:14,310 INFO L87 Difference]: Start difference. First operand 373 states and 541 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:14,357 INFO L93 Difference]: Finished difference Result 749 states and 1085 transitions. [2023-12-16 04:18:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-16 04:18:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:14,359 INFO L225 Difference]: With dead ends: 749 [2023-12-16 04:18:14,360 INFO L226 Difference]: Without dead ends: 377 [2023-12-16 04:18:14,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-16 04:18:14,361 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:14,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-16 04:18:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 372. [2023-12-16 04:18:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 327 states have (on average 1.4036697247706422) internal successors, (459), 329 states have internal predecessors, (459), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-16 04:18:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 539 transitions. [2023-12-16 04:18:14,378 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 539 transitions. Word has length 112 [2023-12-16 04:18:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:14,378 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 539 transitions. [2023-12-16 04:18:14,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 539 transitions. [2023-12-16 04:18:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:18:14,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:14,384 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:14,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:18:14,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:14,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash -633881842, now seen corresponding path program 1 times [2023-12-16 04:18:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907092904] [2023-12-16 04:18:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907092904] [2023-12-16 04:18:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907092904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:14,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946794040] [2023-12-16 04:18:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:14,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:14,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:14,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:14,642 INFO L87 Difference]: Start difference. First operand 372 states and 539 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:14,764 INFO L93 Difference]: Finished difference Result 999 states and 1447 transitions. [2023-12-16 04:18:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:18:14,765 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-16 04:18:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:14,769 INFO L225 Difference]: With dead ends: 999 [2023-12-16 04:18:14,769 INFO L226 Difference]: Without dead ends: 628 [2023-12-16 04:18:14,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:18:14,771 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 221 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:14,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1070 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2023-12-16 04:18:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 584. [2023-12-16 04:18:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 513 states have (on average 1.3996101364522417) internal successors, (718), 515 states have internal predecessors, (718), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-16 04:18:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 846 transitions. [2023-12-16 04:18:14,796 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 846 transitions. Word has length 113 [2023-12-16 04:18:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:14,796 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 846 transitions. [2023-12-16 04:18:14,797 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 846 transitions. [2023-12-16 04:18:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:18:14,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:14,798 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:14,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:18:14,798 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:14,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1713590941, now seen corresponding path program 1 times [2023-12-16 04:18:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509857251] [2023-12-16 04:18:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509857251] [2023-12-16 04:18:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509857251] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300765644] [2023-12-16 04:18:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:15,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:15,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:15,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:15,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:15,294 INFO L87 Difference]: Start difference. First operand 584 states and 846 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:15,391 INFO L93 Difference]: Finished difference Result 1561 states and 2241 transitions. [2023-12-16 04:18:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-16 04:18:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:15,394 INFO L225 Difference]: With dead ends: 1561 [2023-12-16 04:18:15,394 INFO L226 Difference]: Without dead ends: 978 [2023-12-16 04:18:15,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:15,396 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 145 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:15,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 789 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2023-12-16 04:18:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 900. [2023-12-16 04:18:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 811 states have (on average 1.3958076448828607) internal successors, (1132), 819 states have internal predecessors, (1132), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1284 transitions. [2023-12-16 04:18:15,424 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1284 transitions. Word has length 113 [2023-12-16 04:18:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:15,424 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1284 transitions. [2023-12-16 04:18:15,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1284 transitions. [2023-12-16 04:18:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:18:15,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:15,425 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:15,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:18:15,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:15,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:15,426 INFO L85 PathProgramCache]: Analyzing trace with hash 480306248, now seen corresponding path program 1 times [2023-12-16 04:18:15,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:15,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683430985] [2023-12-16 04:18:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:15,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:16,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683430985] [2023-12-16 04:18:16,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683430985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:16,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:16,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 04:18:16,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623778907] [2023-12-16 04:18:16,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:16,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:18:16,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:16,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:18:16,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:18:16,377 INFO L87 Difference]: Start difference. First operand 900 states and 1284 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:17,967 INFO L93 Difference]: Finished difference Result 2998 states and 4280 transitions. [2023-12-16 04:18:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-16 04:18:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2023-12-16 04:18:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:17,975 INFO L225 Difference]: With dead ends: 2998 [2023-12-16 04:18:17,975 INFO L226 Difference]: Without dead ends: 2539 [2023-12-16 04:18:17,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1139, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 04:18:17,976 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1121 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:17,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3171 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:18:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2023-12-16 04:18:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 1965. [2023-12-16 04:18:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1753 states have (on average 1.3953223046206502) internal successors, (2446), 1771 states have internal predecessors, (2446), 182 states have call successors, (182), 29 states have call predecessors, (182), 29 states have return successors, (182), 164 states have call predecessors, (182), 182 states have call successors, (182) [2023-12-16 04:18:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2810 transitions. [2023-12-16 04:18:18,051 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2810 transitions. Word has length 113 [2023-12-16 04:18:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:18,051 INFO L495 AbstractCegarLoop]: Abstraction has 1965 states and 2810 transitions. [2023-12-16 04:18:18,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2810 transitions. [2023-12-16 04:18:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:18:18,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:18,053 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:18,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:18:18,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:18,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:18,053 INFO L85 PathProgramCache]: Analyzing trace with hash 699160966, now seen corresponding path program 1 times [2023-12-16 04:18:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386397648] [2023-12-16 04:18:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386397648] [2023-12-16 04:18:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386397648] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:18,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:18,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745636387] [2023-12-16 04:18:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:18,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:18,325 INFO L87 Difference]: Start difference. First operand 1965 states and 2810 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:18,420 INFO L93 Difference]: Finished difference Result 2460 states and 3491 transitions. [2023-12-16 04:18:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-16 04:18:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:18,424 INFO L225 Difference]: With dead ends: 2460 [2023-12-16 04:18:18,424 INFO L226 Difference]: Without dead ends: 1139 [2023-12-16 04:18:18,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:18,426 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 150 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:18,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 738 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2023-12-16 04:18:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 897. [2023-12-16 04:18:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 790 states have (on average 1.3810126582278481) internal successors, (1091), 794 states have internal predecessors, (1091), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-16 04:18:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1267 transitions. [2023-12-16 04:18:18,459 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1267 transitions. Word has length 113 [2023-12-16 04:18:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:18,459 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 1267 transitions. [2023-12-16 04:18:18,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1267 transitions. [2023-12-16 04:18:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:18:18,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:18,461 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:18,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:18:18,461 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:18,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash 536390063, now seen corresponding path program 1 times [2023-12-16 04:18:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56940759] [2023-12-16 04:18:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:18,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56940759] [2023-12-16 04:18:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56940759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:18,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:18:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763534429] [2023-12-16 04:18:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:18,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:18:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:18:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:18,777 INFO L87 Difference]: Start difference. First operand 897 states and 1267 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:19,105 INFO L93 Difference]: Finished difference Result 2178 states and 3072 transitions. [2023-12-16 04:18:19,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:18:19,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-16 04:18:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:19,109 INFO L225 Difference]: With dead ends: 2178 [2023-12-16 04:18:19,109 INFO L226 Difference]: Without dead ends: 1282 [2023-12-16 04:18:19,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:18:19,112 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 435 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:19,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1060 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2023-12-16 04:18:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 925. [2023-12-16 04:18:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 818 states have (on average 1.3777506112469438) internal successors, (1127), 822 states have internal predecessors, (1127), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-16 04:18:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1303 transitions. [2023-12-16 04:18:19,160 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1303 transitions. Word has length 114 [2023-12-16 04:18:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:19,160 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1303 transitions. [2023-12-16 04:18:19,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1303 transitions. [2023-12-16 04:18:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:18:19,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:19,161 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:19,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:18:19,161 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:19,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash -348434595, now seen corresponding path program 1 times [2023-12-16 04:18:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382111428] [2023-12-16 04:18:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:19,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382111428] [2023-12-16 04:18:19,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382111428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:19,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:19,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:19,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915315363] [2023-12-16 04:18:19,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:19,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:19,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:19,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:19,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:19,466 INFO L87 Difference]: Start difference. First operand 925 states and 1303 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:19,641 INFO L93 Difference]: Finished difference Result 2095 states and 2930 transitions. [2023-12-16 04:18:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:19,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-16 04:18:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:19,645 INFO L225 Difference]: With dead ends: 2095 [2023-12-16 04:18:19,645 INFO L226 Difference]: Without dead ends: 1171 [2023-12-16 04:18:19,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:19,647 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 73 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:19,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 650 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2023-12-16 04:18:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 923. [2023-12-16 04:18:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 816 states have (on average 1.3713235294117647) internal successors, (1119), 820 states have internal predecessors, (1119), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-16 04:18:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1295 transitions. [2023-12-16 04:18:19,747 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1295 transitions. Word has length 114 [2023-12-16 04:18:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:19,747 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1295 transitions. [2023-12-16 04:18:19,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1295 transitions. [2023-12-16 04:18:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 04:18:19,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:19,748 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:19,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:18:19,749 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:19,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash -74891543, now seen corresponding path program 1 times [2023-12-16 04:18:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:19,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308687180] [2023-12-16 04:18:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308687180] [2023-12-16 04:18:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308687180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:19,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823297914] [2023-12-16 04:18:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:19,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:19,973 INFO L87 Difference]: Start difference. First operand 923 states and 1295 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:20,083 INFO L93 Difference]: Finished difference Result 1934 states and 2704 transitions. [2023-12-16 04:18:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:20,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-16 04:18:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:20,087 INFO L225 Difference]: With dead ends: 1934 [2023-12-16 04:18:20,087 INFO L226 Difference]: Without dead ends: 1012 [2023-12-16 04:18:20,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:20,088 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 75 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:20,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 887 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2023-12-16 04:18:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 873. [2023-12-16 04:18:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 766 states have (on average 1.3694516971279374) internal successors, (1049), 770 states have internal predecessors, (1049), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-16 04:18:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1225 transitions. [2023-12-16 04:18:20,132 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1225 transitions. Word has length 115 [2023-12-16 04:18:20,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:20,134 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1225 transitions. [2023-12-16 04:18:20,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1225 transitions. [2023-12-16 04:18:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 04:18:20,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:20,135 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:20,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:18:20,135 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:20,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash 149492180, now seen corresponding path program 1 times [2023-12-16 04:18:20,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:20,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585911339] [2023-12-16 04:18:20,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585911339] [2023-12-16 04:18:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585911339] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:20,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:20,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014713502] [2023-12-16 04:18:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:20,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:20,360 INFO L87 Difference]: Start difference. First operand 873 states and 1225 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:20,452 INFO L93 Difference]: Finished difference Result 1874 states and 2620 transitions. [2023-12-16 04:18:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-16 04:18:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:20,455 INFO L225 Difference]: With dead ends: 1874 [2023-12-16 04:18:20,456 INFO L226 Difference]: Without dead ends: 1002 [2023-12-16 04:18:20,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:20,457 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 74 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:20,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 676 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2023-12-16 04:18:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 871. [2023-12-16 04:18:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 764 states have (on average 1.362565445026178) internal successors, (1041), 768 states have internal predecessors, (1041), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-16 04:18:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1217 transitions. [2023-12-16 04:18:20,497 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1217 transitions. Word has length 115 [2023-12-16 04:18:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:20,497 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1217 transitions. [2023-12-16 04:18:20,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1217 transitions. [2023-12-16 04:18:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 04:18:20,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:20,498 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:20,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:18:20,498 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:20,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:20,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1655946154, now seen corresponding path program 1 times [2023-12-16 04:18:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:20,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681614811] [2023-12-16 04:18:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:20,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:20,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681614811] [2023-12-16 04:18:20,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681614811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:20,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:20,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473153567] [2023-12-16 04:18:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:20,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:20,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:20,732 INFO L87 Difference]: Start difference. First operand 871 states and 1217 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:20,846 INFO L93 Difference]: Finished difference Result 1936 states and 2699 transitions. [2023-12-16 04:18:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:20,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-16 04:18:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:20,850 INFO L225 Difference]: With dead ends: 1936 [2023-12-16 04:18:20,850 INFO L226 Difference]: Without dead ends: 1066 [2023-12-16 04:18:20,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:20,852 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 97 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:20,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 736 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2023-12-16 04:18:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 871. [2023-12-16 04:18:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 764 states have (on average 1.3494764397905759) internal successors, (1031), 768 states have internal predecessors, (1031), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-16 04:18:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1207 transitions. [2023-12-16 04:18:20,898 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1207 transitions. Word has length 115 [2023-12-16 04:18:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:20,898 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1207 transitions. [2023-12-16 04:18:20,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1207 transitions. [2023-12-16 04:18:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 04:18:20,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:20,900 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:20,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:18:20,900 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:20,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1359157464, now seen corresponding path program 1 times [2023-12-16 04:18:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:20,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937258911] [2023-12-16 04:18:20,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:21,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:21,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937258911] [2023-12-16 04:18:21,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937258911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:21,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:21,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:18:21,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761526581] [2023-12-16 04:18:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:21,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:18:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:21,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:18:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:21,220 INFO L87 Difference]: Start difference. First operand 871 states and 1207 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:21,523 INFO L93 Difference]: Finished difference Result 1673 states and 2312 transitions. [2023-12-16 04:18:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:18:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-16 04:18:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:21,526 INFO L225 Difference]: With dead ends: 1673 [2023-12-16 04:18:21,526 INFO L226 Difference]: Without dead ends: 781 [2023-12-16 04:18:21,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:18:21,527 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 389 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:21,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 992 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-12-16 04:18:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 751. [2023-12-16 04:18:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 659 states have (on average 1.3490136570561457) internal successors, (889), 662 states have internal predecessors, (889), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1041 transitions. [2023-12-16 04:18:21,581 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1041 transitions. Word has length 115 [2023-12-16 04:18:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:21,581 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1041 transitions. [2023-12-16 04:18:21,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1041 transitions. [2023-12-16 04:18:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 04:18:21,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:21,583 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:21,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:18:21,583 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:21,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash 849684374, now seen corresponding path program 1 times [2023-12-16 04:18:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:21,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662683682] [2023-12-16 04:18:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662683682] [2023-12-16 04:18:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662683682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:21,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:18:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282336227] [2023-12-16 04:18:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:21,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:18:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:21,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:18:21,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:21,909 INFO L87 Difference]: Start difference. First operand 751 states and 1041 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:22,224 INFO L93 Difference]: Finished difference Result 1661 states and 2299 transitions. [2023-12-16 04:18:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:18:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-16 04:18:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:22,227 INFO L225 Difference]: With dead ends: 1661 [2023-12-16 04:18:22,227 INFO L226 Difference]: Without dead ends: 911 [2023-12-16 04:18:22,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:18:22,229 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 311 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:22,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 978 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2023-12-16 04:18:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 751. [2023-12-16 04:18:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 659 states have (on average 1.347496206373293) internal successors, (888), 662 states have internal predecessors, (888), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1040 transitions. [2023-12-16 04:18:22,263 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1040 transitions. Word has length 115 [2023-12-16 04:18:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:22,263 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1040 transitions. [2023-12-16 04:18:22,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1040 transitions. [2023-12-16 04:18:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 04:18:22,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:22,264 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:22,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:18:22,265 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:22,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1639103148, now seen corresponding path program 1 times [2023-12-16 04:18:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:22,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266512054] [2023-12-16 04:18:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:22,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:22,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266512054] [2023-12-16 04:18:22,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266512054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:22,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:22,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:18:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160204942] [2023-12-16 04:18:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:22,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:18:22,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:18:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:18:22,891 INFO L87 Difference]: Start difference. First operand 751 states and 1040 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:24,236 INFO L93 Difference]: Finished difference Result 1494 states and 2076 transitions. [2023-12-16 04:18:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:18:24,237 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-16 04:18:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:24,240 INFO L225 Difference]: With dead ends: 1494 [2023-12-16 04:18:24,241 INFO L226 Difference]: Without dead ends: 1148 [2023-12-16 04:18:24,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:18:24,242 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 401 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:24,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 2323 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:18:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2023-12-16 04:18:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 793. [2023-12-16 04:18:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 701 states have (on average 1.3452211126961484) internal successors, (943), 704 states have internal predecessors, (943), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1095 transitions. [2023-12-16 04:18:24,295 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1095 transitions. Word has length 116 [2023-12-16 04:18:24,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:24,295 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1095 transitions. [2023-12-16 04:18:24,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1095 transitions. [2023-12-16 04:18:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 04:18:24,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:24,297 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:24,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 04:18:24,297 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:24,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1498554538, now seen corresponding path program 1 times [2023-12-16 04:18:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:24,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461369266] [2023-12-16 04:18:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:24,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:24,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461369266] [2023-12-16 04:18:24,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461369266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:24,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:24,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:18:24,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812614230] [2023-12-16 04:18:24,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:24,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:18:24,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:24,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:18:24,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:18:24,928 INFO L87 Difference]: Start difference. First operand 793 states and 1095 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:25,951 INFO L93 Difference]: Finished difference Result 1548 states and 2146 transitions. [2023-12-16 04:18:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:18:25,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-16 04:18:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:25,956 INFO L225 Difference]: With dead ends: 1548 [2023-12-16 04:18:25,956 INFO L226 Difference]: Without dead ends: 1160 [2023-12-16 04:18:25,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:18:25,958 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 396 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:25,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2338 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:18:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2023-12-16 04:18:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 763. [2023-12-16 04:18:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 671 states have (on average 1.34575260804769) internal successors, (903), 674 states have internal predecessors, (903), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1055 transitions. [2023-12-16 04:18:26,026 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1055 transitions. Word has length 116 [2023-12-16 04:18:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:26,026 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1055 transitions. [2023-12-16 04:18:26,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1055 transitions. [2023-12-16 04:18:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 04:18:26,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:26,027 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:26,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:18:26,027 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:26,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1908231937, now seen corresponding path program 1 times [2023-12-16 04:18:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751547981] [2023-12-16 04:18:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:26,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:26,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751547981] [2023-12-16 04:18:26,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751547981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:26,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:18:26,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084574780] [2023-12-16 04:18:26,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:26,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:18:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:26,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:18:26,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:26,262 INFO L87 Difference]: Start difference. First operand 763 states and 1055 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:26,442 INFO L93 Difference]: Finished difference Result 1674 states and 2316 transitions. [2023-12-16 04:18:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:18:26,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-16 04:18:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:26,445 INFO L225 Difference]: With dead ends: 1674 [2023-12-16 04:18:26,445 INFO L226 Difference]: Without dead ends: 912 [2023-12-16 04:18:26,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:18:26,447 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 381 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:26,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1383 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2023-12-16 04:18:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 774. [2023-12-16 04:18:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 682 states have (on average 1.3387096774193548) internal successors, (913), 685 states have internal predecessors, (913), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1065 transitions. [2023-12-16 04:18:26,501 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1065 transitions. Word has length 116 [2023-12-16 04:18:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:26,501 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1065 transitions. [2023-12-16 04:18:26,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1065 transitions. [2023-12-16 04:18:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 04:18:26,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:26,502 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:26,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:18:26,503 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:26,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1964033533, now seen corresponding path program 1 times [2023-12-16 04:18:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:26,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61405037] [2023-12-16 04:18:26,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:26,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61405037] [2023-12-16 04:18:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61405037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930560445] [2023-12-16 04:18:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:26,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:26,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:26,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:26,779 INFO L87 Difference]: Start difference. First operand 774 states and 1065 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:26,883 INFO L93 Difference]: Finished difference Result 1727 states and 2378 transitions. [2023-12-16 04:18:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-12-16 04:18:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:26,886 INFO L225 Difference]: With dead ends: 1727 [2023-12-16 04:18:26,886 INFO L226 Difference]: Without dead ends: 954 [2023-12-16 04:18:26,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:26,888 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 115 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:26,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1013 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2023-12-16 04:18:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 776. [2023-12-16 04:18:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 684 states have (on average 1.337719298245614) internal successors, (915), 687 states have internal predecessors, (915), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1067 transitions. [2023-12-16 04:18:26,937 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1067 transitions. Word has length 116 [2023-12-16 04:18:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:26,937 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1067 transitions. [2023-12-16 04:18:26,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1067 transitions. [2023-12-16 04:18:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:18:26,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:26,938 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:26,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 04:18:26,939 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:26,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1204295652, now seen corresponding path program 1 times [2023-12-16 04:18:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574531561] [2023-12-16 04:18:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:27,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574531561] [2023-12-16 04:18:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574531561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:27,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:18:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881946682] [2023-12-16 04:18:27,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:27,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:18:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:27,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:18:27,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:18:27,646 INFO L87 Difference]: Start difference. First operand 776 states and 1067 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:29,388 INFO L93 Difference]: Finished difference Result 1603 states and 2208 transitions. [2023-12-16 04:18:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 04:18:29,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-16 04:18:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:29,392 INFO L225 Difference]: With dead ends: 1603 [2023-12-16 04:18:29,392 INFO L226 Difference]: Without dead ends: 1229 [2023-12-16 04:18:29,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-12-16 04:18:29,394 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 549 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:29,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1607 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:18:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2023-12-16 04:18:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 796. [2023-12-16 04:18:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 704 states have (on average 1.3352272727272727) internal successors, (940), 707 states have internal predecessors, (940), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1092 transitions. [2023-12-16 04:18:29,450 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1092 transitions. Word has length 117 [2023-12-16 04:18:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:29,451 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1092 transitions. [2023-12-16 04:18:29,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1092 transitions. [2023-12-16 04:18:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:18:29,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:29,453 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:29,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 04:18:29,453 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:29,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1266335266, now seen corresponding path program 1 times [2023-12-16 04:18:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:29,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027544595] [2023-12-16 04:18:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:30,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027544595] [2023-12-16 04:18:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027544595] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:30,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:30,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:18:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413735584] [2023-12-16 04:18:30,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:30,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:18:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:30,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:18:30,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:18:30,072 INFO L87 Difference]: Start difference. First operand 796 states and 1092 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:31,372 INFO L93 Difference]: Finished difference Result 1655 states and 2278 transitions. [2023-12-16 04:18:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:18:31,376 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-16 04:18:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:31,379 INFO L225 Difference]: With dead ends: 1655 [2023-12-16 04:18:31,379 INFO L226 Difference]: Without dead ends: 1261 [2023-12-16 04:18:31,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-16 04:18:31,380 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 531 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:31,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1745 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:18:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2023-12-16 04:18:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 777. [2023-12-16 04:18:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 685 states have (on average 1.3372262773722627) internal successors, (916), 688 states have internal predecessors, (916), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1068 transitions. [2023-12-16 04:18:31,445 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1068 transitions. Word has length 117 [2023-12-16 04:18:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:31,445 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1068 transitions. [2023-12-16 04:18:31,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1068 transitions. [2023-12-16 04:18:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:18:31,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:31,446 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:31,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 04:18:31,446 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:31,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1690555580, now seen corresponding path program 1 times [2023-12-16 04:18:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167729277] [2023-12-16 04:18:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:31,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167729277] [2023-12-16 04:18:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167729277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:31,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075667220] [2023-12-16 04:18:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:31,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:31,685 INFO L87 Difference]: Start difference. First operand 777 states and 1068 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:31,824 INFO L93 Difference]: Finished difference Result 1754 states and 2412 transitions. [2023-12-16 04:18:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:31,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-16 04:18:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:31,827 INFO L225 Difference]: With dead ends: 1754 [2023-12-16 04:18:31,827 INFO L226 Difference]: Without dead ends: 978 [2023-12-16 04:18:31,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:31,829 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 129 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:31,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 736 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2023-12-16 04:18:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 787. [2023-12-16 04:18:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 695 states have (on average 1.3280575539568344) internal successors, (923), 698 states have internal predecessors, (923), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:18:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1075 transitions. [2023-12-16 04:18:31,892 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1075 transitions. Word has length 117 [2023-12-16 04:18:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:31,892 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1075 transitions. [2023-12-16 04:18:31,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1075 transitions. [2023-12-16 04:18:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:18:31,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:31,894 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:31,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 04:18:31,894 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:31,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1539091155, now seen corresponding path program 1 times [2023-12-16 04:18:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:31,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487515731] [2023-12-16 04:18:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:31,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:32,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487515731] [2023-12-16 04:18:32,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487515731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:32,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:32,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:18:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649842179] [2023-12-16 04:18:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:32,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:18:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:32,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:18:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:18:32,320 INFO L87 Difference]: Start difference. First operand 787 states and 1075 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:32,658 INFO L93 Difference]: Finished difference Result 1695 states and 2311 transitions. [2023-12-16 04:18:32,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:18:32,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-16 04:18:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:32,661 INFO L225 Difference]: With dead ends: 1695 [2023-12-16 04:18:32,661 INFO L226 Difference]: Without dead ends: 909 [2023-12-16 04:18:32,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:18:32,663 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 582 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:32,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 833 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2023-12-16 04:18:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 841. [2023-12-16 04:18:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.3247282608695652) internal successors, (975), 740 states have internal predecessors, (975), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-16 04:18:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1147 transitions. [2023-12-16 04:18:32,727 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1147 transitions. Word has length 117 [2023-12-16 04:18:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:32,727 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1147 transitions. [2023-12-16 04:18:32,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1147 transitions. [2023-12-16 04:18:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:18:32,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:32,728 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:32,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 04:18:32,728 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:32,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1146064145, now seen corresponding path program 1 times [2023-12-16 04:18:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:32,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484539374] [2023-12-16 04:18:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:33,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:33,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484539374] [2023-12-16 04:18:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484539374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:33,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:18:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078494780] [2023-12-16 04:18:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:33,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:18:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:18:33,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:18:33,094 INFO L87 Difference]: Start difference. First operand 841 states and 1147 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:33,488 INFO L93 Difference]: Finished difference Result 1654 states and 2248 transitions. [2023-12-16 04:18:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:18:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-16 04:18:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:33,490 INFO L225 Difference]: With dead ends: 1654 [2023-12-16 04:18:33,490 INFO L226 Difference]: Without dead ends: 864 [2023-12-16 04:18:33,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:18:33,492 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 531 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:33,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1583 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-12-16 04:18:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 841. [2023-12-16 04:18:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.3233695652173914) internal successors, (974), 740 states have internal predecessors, (974), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-16 04:18:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1146 transitions. [2023-12-16 04:18:33,547 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1146 transitions. Word has length 117 [2023-12-16 04:18:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:33,547 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1146 transitions. [2023-12-16 04:18:33,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1146 transitions. [2023-12-16 04:18:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:18:33,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:33,548 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:33,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 04:18:33,549 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:33,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1516458901, now seen corresponding path program 1 times [2023-12-16 04:18:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828474466] [2023-12-16 04:18:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:34,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828474466] [2023-12-16 04:18:34,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828474466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:34,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:34,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-16 04:18:34,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055005693] [2023-12-16 04:18:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:34,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 04:18:34,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 04:18:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:18:34,678 INFO L87 Difference]: Start difference. First operand 841 states and 1146 transitions. Second operand has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:36,026 INFO L93 Difference]: Finished difference Result 1733 states and 2349 transitions. [2023-12-16 04:18:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:18:36,027 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-16 04:18:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:36,030 INFO L225 Difference]: With dead ends: 1733 [2023-12-16 04:18:36,030 INFO L226 Difference]: Without dead ends: 943 [2023-12-16 04:18:36,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=260, Invalid=1146, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 04:18:36,033 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 682 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:36,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 3191 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:18:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2023-12-16 04:18:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 800. [2023-12-16 04:18:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 708 states have (on average 1.3192090395480225) internal successors, (934), 711 states have internal predecessors, (934), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-16 04:18:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1082 transitions. [2023-12-16 04:18:36,108 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1082 transitions. Word has length 117 [2023-12-16 04:18:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:36,108 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1082 transitions. [2023-12-16 04:18:36,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1082 transitions. [2023-12-16 04:18:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:18:36,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:36,109 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:36,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 04:18:36,109 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:36,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash -188901552, now seen corresponding path program 1 times [2023-12-16 04:18:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:36,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353979353] [2023-12-16 04:18:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:36,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353979353] [2023-12-16 04:18:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353979353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:36,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:18:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832051752] [2023-12-16 04:18:36,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:36,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:18:36,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:18:36,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:18:36,502 INFO L87 Difference]: Start difference. First operand 800 states and 1082 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:36,847 INFO L93 Difference]: Finished difference Result 1306 states and 1780 transitions. [2023-12-16 04:18:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:18:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-12-16 04:18:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:36,863 INFO L225 Difference]: With dead ends: 1306 [2023-12-16 04:18:36,863 INFO L226 Difference]: Without dead ends: 913 [2023-12-16 04:18:36,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:18:36,865 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 154 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:36,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1614 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2023-12-16 04:18:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 809. [2023-12-16 04:18:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 717 states have (on average 1.3152022315202232) internal successors, (943), 720 states have internal predecessors, (943), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-16 04:18:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1091 transitions. [2023-12-16 04:18:36,933 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1091 transitions. Word has length 119 [2023-12-16 04:18:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:36,933 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1091 transitions. [2023-12-16 04:18:36,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1091 transitions. [2023-12-16 04:18:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:18:36,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:36,934 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:36,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 04:18:36,935 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:36,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash -37437127, now seen corresponding path program 1 times [2023-12-16 04:18:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:36,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368446523] [2023-12-16 04:18:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368446523] [2023-12-16 04:18:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368446523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:37,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:37,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:37,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049480639] [2023-12-16 04:18:37,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:37,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:37,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:37,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:37,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:37,122 INFO L87 Difference]: Start difference. First operand 809 states and 1091 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:37,345 INFO L93 Difference]: Finished difference Result 1294 states and 1745 transitions. [2023-12-16 04:18:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:37,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-12-16 04:18:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:37,350 INFO L225 Difference]: With dead ends: 1294 [2023-12-16 04:18:37,351 INFO L226 Difference]: Without dead ends: 892 [2023-12-16 04:18:37,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:37,352 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 75 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:37,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 815 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2023-12-16 04:18:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 809. [2023-12-16 04:18:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 717 states have (on average 1.3110181311018132) internal successors, (940), 720 states have internal predecessors, (940), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-16 04:18:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1088 transitions. [2023-12-16 04:18:37,408 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1088 transitions. Word has length 119 [2023-12-16 04:18:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:37,408 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1088 transitions. [2023-12-16 04:18:37,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1088 transitions. [2023-12-16 04:18:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:18:37,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:37,409 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:37,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 04:18:37,410 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:37,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1634563139, now seen corresponding path program 1 times [2023-12-16 04:18:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703589061] [2023-12-16 04:18:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703589061] [2023-12-16 04:18:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703589061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199675272] [2023-12-16 04:18:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:37,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:37,498 INFO L87 Difference]: Start difference. First operand 809 states and 1088 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:37,581 INFO L93 Difference]: Finished difference Result 1687 states and 2273 transitions. [2023-12-16 04:18:37,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:37,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-16 04:18:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:37,583 INFO L225 Difference]: With dead ends: 1687 [2023-12-16 04:18:37,583 INFO L226 Difference]: Without dead ends: 879 [2023-12-16 04:18:37,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:37,584 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 45 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:37,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2023-12-16 04:18:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 830. [2023-12-16 04:18:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 738 states have (on average 1.3021680216802167) internal successors, (961), 741 states have internal predecessors, (961), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-16 04:18:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1109 transitions. [2023-12-16 04:18:37,660 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1109 transitions. Word has length 119 [2023-12-16 04:18:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:37,660 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1109 transitions. [2023-12-16 04:18:37,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1109 transitions. [2023-12-16 04:18:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:18:37,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:37,661 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:37,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 04:18:37,662 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:37,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash 935107953, now seen corresponding path program 1 times [2023-12-16 04:18:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:37,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213593266] [2023-12-16 04:18:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213593266] [2023-12-16 04:18:38,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213593266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:38,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:38,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 04:18:38,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881046028] [2023-12-16 04:18:38,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:38,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:18:38,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:38,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:18:38,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:18:38,560 INFO L87 Difference]: Start difference. First operand 830 states and 1109 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:39,550 INFO L93 Difference]: Finished difference Result 1787 states and 2386 transitions. [2023-12-16 04:18:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:18:39,550 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 120 [2023-12-16 04:18:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:39,552 INFO L225 Difference]: With dead ends: 1787 [2023-12-16 04:18:39,552 INFO L226 Difference]: Without dead ends: 958 [2023-12-16 04:18:39,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2023-12-16 04:18:39,554 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 863 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:39,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2000 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:18:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2023-12-16 04:18:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 838. [2023-12-16 04:18:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 746 states have (on average 1.2989276139410189) internal successors, (969), 749 states have internal predecessors, (969), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-16 04:18:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1117 transitions. [2023-12-16 04:18:39,615 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1117 transitions. Word has length 120 [2023-12-16 04:18:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:39,615 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1117 transitions. [2023-12-16 04:18:39,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:18:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1117 transitions. [2023-12-16 04:18:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:18:39,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:39,616 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:39,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 04:18:39,616 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:39,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1328134963, now seen corresponding path program 1 times [2023-12-16 04:18:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:39,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277763486] [2023-12-16 04:18:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:40,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277763486] [2023-12-16 04:18:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277763486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:40,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:18:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494026449] [2023-12-16 04:18:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:40,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:18:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:18:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:18:40,033 INFO L87 Difference]: Start difference. First operand 838 states and 1117 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:40,531 INFO L93 Difference]: Finished difference Result 1731 states and 2306 transitions. [2023-12-16 04:18:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:18:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2023-12-16 04:18:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:40,533 INFO L225 Difference]: With dead ends: 1731 [2023-12-16 04:18:40,533 INFO L226 Difference]: Without dead ends: 894 [2023-12-16 04:18:40,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:18:40,535 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 319 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:40,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1239 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:18:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2023-12-16 04:18:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 821. [2023-12-16 04:18:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 729 states have (on average 1.297668038408779) internal successors, (946), 732 states have internal predecessors, (946), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-16 04:18:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1094 transitions. [2023-12-16 04:18:40,594 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1094 transitions. Word has length 120 [2023-12-16 04:18:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:40,594 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1094 transitions. [2023-12-16 04:18:40,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1094 transitions. [2023-12-16 04:18:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:18:40,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:40,595 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:40,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 04:18:40,596 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:40,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash -265899400, now seen corresponding path program 1 times [2023-12-16 04:18:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:40,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039558369] [2023-12-16 04:18:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:40,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:40,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039558369] [2023-12-16 04:18:40,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039558369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:40,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:40,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918372961] [2023-12-16 04:18:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:40,752 INFO L87 Difference]: Start difference. First operand 821 states and 1094 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:40,875 INFO L93 Difference]: Finished difference Result 1746 states and 2323 transitions. [2023-12-16 04:18:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:40,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2023-12-16 04:18:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:40,877 INFO L225 Difference]: With dead ends: 1746 [2023-12-16 04:18:40,877 INFO L226 Difference]: Without dead ends: 926 [2023-12-16 04:18:40,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:40,879 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 137 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:40,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 572 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2023-12-16 04:18:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 804. [2023-12-16 04:18:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 712 states have (on average 1.2879213483146068) internal successors, (917), 715 states have internal predecessors, (917), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-16 04:18:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1065 transitions. [2023-12-16 04:18:40,939 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1065 transitions. Word has length 121 [2023-12-16 04:18:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:40,939 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1065 transitions. [2023-12-16 04:18:40,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1065 transitions. [2023-12-16 04:18:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 04:18:40,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:40,940 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:40,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 04:18:40,940 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:40,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -614941095, now seen corresponding path program 1 times [2023-12-16 04:18:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057985374] [2023-12-16 04:18:40,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:42,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:42,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057985374] [2023-12-16 04:18:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057985374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:42,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:42,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-16 04:18:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097485626] [2023-12-16 04:18:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:42,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 04:18:42,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 04:18:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-12-16 04:18:42,561 INFO L87 Difference]: Start difference. First operand 804 states and 1065 transitions. Second operand has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-16 04:18:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:49,886 INFO L93 Difference]: Finished difference Result 1685 states and 2243 transitions. [2023-12-16 04:18:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-16 04:18:49,886 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 123 [2023-12-16 04:18:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:49,888 INFO L225 Difference]: With dead ends: 1685 [2023-12-16 04:18:49,888 INFO L226 Difference]: Without dead ends: 1271 [2023-12-16 04:18:49,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=603, Invalid=2367, Unknown=0, NotChecked=0, Total=2970 [2023-12-16 04:18:49,890 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 773 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:49,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2719 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 04:18:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2023-12-16 04:18:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 947. [2023-12-16 04:18:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 845 states have (on average 1.2875739644970414) internal successors, (1088), 849 states have internal predecessors, (1088), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-16 04:18:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1252 transitions. [2023-12-16 04:18:49,983 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1252 transitions. Word has length 123 [2023-12-16 04:18:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:49,983 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1252 transitions. [2023-12-16 04:18:49,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-16 04:18:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1252 transitions. [2023-12-16 04:18:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 04:18:49,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:49,984 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 04:18:49,984 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:49,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1424287721, now seen corresponding path program 1 times [2023-12-16 04:18:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:49,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183917941] [2023-12-16 04:18:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:50,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183917941] [2023-12-16 04:18:50,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183917941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:50,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:50,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093750448] [2023-12-16 04:18:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:50,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:50,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:50,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:50,171 INFO L87 Difference]: Start difference. First operand 947 states and 1252 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:50,355 INFO L93 Difference]: Finished difference Result 1582 states and 2099 transitions. [2023-12-16 04:18:50,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:50,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-16 04:18:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:50,357 INFO L225 Difference]: With dead ends: 1582 [2023-12-16 04:18:50,357 INFO L226 Difference]: Without dead ends: 1025 [2023-12-16 04:18:50,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:50,358 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 104 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:50,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1031 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-12-16 04:18:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 943. [2023-12-16 04:18:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 841 states have (on average 1.2853745541022592) internal successors, (1081), 845 states have internal predecessors, (1081), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-16 04:18:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1245 transitions. [2023-12-16 04:18:50,432 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1245 transitions. Word has length 123 [2023-12-16 04:18:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:50,432 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1245 transitions. [2023-12-16 04:18:50,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1245 transitions. [2023-12-16 04:18:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 04:18:50,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:50,433 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:50,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-16 04:18:50,433 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:50,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -340181481, now seen corresponding path program 1 times [2023-12-16 04:18:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818712838] [2023-12-16 04:18:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:50,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818712838] [2023-12-16 04:18:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818712838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:50,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:50,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876872326] [2023-12-16 04:18:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:50,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:50,589 INFO L87 Difference]: Start difference. First operand 943 states and 1245 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:50,795 INFO L93 Difference]: Finished difference Result 1748 states and 2328 transitions. [2023-12-16 04:18:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:50,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-16 04:18:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:50,799 INFO L225 Difference]: With dead ends: 1748 [2023-12-16 04:18:50,799 INFO L226 Difference]: Without dead ends: 1195 [2023-12-16 04:18:50,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:50,800 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 110 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:50,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 836 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2023-12-16 04:18:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 931. [2023-12-16 04:18:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 829 states have (on average 1.2858866103739446) internal successors, (1066), 833 states have internal predecessors, (1066), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-16 04:18:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1230 transitions. [2023-12-16 04:18:50,887 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1230 transitions. Word has length 123 [2023-12-16 04:18:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:50,887 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1230 transitions. [2023-12-16 04:18:50,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1230 transitions. [2023-12-16 04:18:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 04:18:50,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:50,890 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:50,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-16 04:18:50,890 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:50,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1149528107, now seen corresponding path program 1 times [2023-12-16 04:18:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958679660] [2023-12-16 04:18:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:18:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:18:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958679660] [2023-12-16 04:18:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958679660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:18:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699671597] [2023-12-16 04:18:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:51,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:18:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:18:51,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:18:51,681 INFO L87 Difference]: Start difference. First operand 931 states and 1230 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:52,411 INFO L93 Difference]: Finished difference Result 1642 states and 2183 transitions. [2023-12-16 04:18:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:18:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-16 04:18:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:52,414 INFO L225 Difference]: With dead ends: 1642 [2023-12-16 04:18:52,414 INFO L226 Difference]: Without dead ends: 1101 [2023-12-16 04:18:52,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:18:52,415 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 164 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:52,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1874 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:18:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2023-12-16 04:18:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 925. [2023-12-16 04:18:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 823 states have (on average 1.2867557715674363) internal successors, (1059), 827 states have internal predecessors, (1059), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-16 04:18:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1223 transitions. [2023-12-16 04:18:52,498 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1223 transitions. Word has length 123 [2023-12-16 04:18:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:52,498 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1223 transitions. [2023-12-16 04:18:52,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1223 transitions. [2023-12-16 04:18:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 04:18:52,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:52,499 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:52,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-16 04:18:52,500 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:52,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -170168634, now seen corresponding path program 1 times [2023-12-16 04:18:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:52,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770280184] [2023-12-16 04:18:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:18:52,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:18:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:18:52,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:18:52,584 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:18:52,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:18:52,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-16 04:18:52,588 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] [2023-12-16 04:18:52,590 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:18:52,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:18:52 BoogieIcfgContainer [2023-12-16 04:18:52,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:18:52,640 INFO L158 Benchmark]: Toolchain (without parser) took 41693.20ms. Allocated memory was 180.4MB in the beginning and 928.0MB in the end (delta: 747.6MB). Free memory was 130.0MB in the beginning and 503.7MB in the end (delta: -373.7MB). Peak memory consumption was 374.3MB. Max. memory is 8.0GB. [2023-12-16 04:18:52,640 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:18:52,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.61ms. Allocated memory is still 180.4MB. Free memory was 129.6MB in the beginning and 115.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:18:52,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.95ms. Allocated memory is still 180.4MB. Free memory was 115.3MB in the beginning and 111.5MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:18:52,641 INFO L158 Benchmark]: Boogie Preprocessor took 68.15ms. Allocated memory is still 180.4MB. Free memory was 111.5MB in the beginning and 106.9MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:18:52,641 INFO L158 Benchmark]: RCFGBuilder took 610.00ms. Allocated memory was 180.4MB in the beginning and 261.1MB in the end (delta: 80.7MB). Free memory was 106.6MB in the beginning and 214.1MB in the end (delta: -107.5MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2023-12-16 04:18:52,641 INFO L158 Benchmark]: TraceAbstraction took 40692.59ms. Allocated memory was 261.1MB in the beginning and 928.0MB in the end (delta: 666.9MB). Free memory was 213.5MB in the beginning and 503.7MB in the end (delta: -290.1MB). Peak memory consumption was 376.8MB. Max. memory is 8.0GB. [2023-12-16 04:18:52,641 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.12ms. Allocated memory is still 180.4MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.61ms. Allocated memory is still 180.4MB. Free memory was 129.6MB in the beginning and 115.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.95ms. Allocated memory is still 180.4MB. Free memory was 115.3MB in the beginning and 111.5MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.15ms. Allocated memory is still 180.4MB. Free memory was 111.5MB in the beginning and 106.9MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 610.00ms. Allocated memory was 180.4MB in the beginning and 261.1MB in the end (delta: 80.7MB). Free memory was 106.6MB in the beginning and 214.1MB in the end (delta: -107.5MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. * TraceAbstraction took 40692.59ms. Allocated memory was 261.1MB in the beginning and 928.0MB in the end (delta: 666.9MB). Free memory was 213.5MB in the beginning and 503.7MB in the end (delta: -290.1MB). Peak memory consumption was 376.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -10; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR signed_long_int_Array_0[0] [L91] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] double_Array_0[0] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] double_Array_0[1] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] double_Array_0[3] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] double_Array_0[4] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] RET updateVariables() [L103] CALL step() [L41] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L44] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] unsigned_long_int_Array_0[1] = ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))) [L46] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L46] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L50] EXPR signed_long_int_Array_0[0] [L50] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L51] EXPR signed_long_int_Array_0[0] [L51] EXPR signed_long_int_Array_0[0] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L51] COND TRUE stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L52] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L52] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[1]) [L57] signed_char_Array_0[1] = 2 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] EXPR signed_char_Array_0[1] [L62] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] COND TRUE signed_char_Array_0[1] >= signed_char_Array_0[1] [L63] EXPR double_Array_0[0] [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L63] double_Array_0[2] = (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR BOOL_unsigned_char_Array_0[1] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) [L94] EXPR signed_char_Array_0[1] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) [L94] EXPR unsigned_long_int_Array_0[1] [L94] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) [L94] EXPR signed_char_Array_0[1] [L94] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) [L94] EXPR double_Array_0[2] [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94-L95] return ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.6s, OverallIterations: 39, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10649 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10628 mSDsluCounter, 44663 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36821 mSDsCounter, 1145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12313 IncrementalHoareTripleChecker+Invalid, 13458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1145 mSolverCounterUnsat, 7842 mSDtfsCounter, 12313 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1965occurred in iteration=10, InterpolantAutomatonStates: 399, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 38 MinimizatonAttempts, 6111 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 4527 NumberOfCodeBlocks, 4527 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4366 ConstructedInterpolants, 0 QuantifiedInterpolants, 34202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 10032/10032 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-16 04:18:52,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...