/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-88.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:20:17,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:20:17,317 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:20:17,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:20:17,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:20:17,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:20:17,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:20:17,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:20:17,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:20:17,347 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:20:17,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:20:17,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:20:17,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:20:17,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:20:17,349 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:20:17,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:20:17,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:20:17,349 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:20:17,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:20:17,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:20:17,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:20:17,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:20:17,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:20:17,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:20:17,351 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:20:17,351 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:20:17,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:20:17,351 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:20:17,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:20:17,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:20:17,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:20:17,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:20:17,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:20:17,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:20:17,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:20:17,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:20:17,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:20:17,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:20:17,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:20:17,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:20:17,354 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:20:17,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:20:17,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:20:17,355 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:20:17,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:20:17,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:20:17,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:20:17,589 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:20:17,589 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:20:17,590 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-88.i [2023-12-16 04:20:18,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:20:18,972 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:20:18,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2023-12-16 04:20:18,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270b64a98/0d465b04923842fb97537b0b9fdd0f36/FLAG845f5dec7 [2023-12-16 04:20:18,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270b64a98/0d465b04923842fb97537b0b9fdd0f36 [2023-12-16 04:20:18,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:20:18,998 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:20:19,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:20:19,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:20:19,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:20:19,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:20:18" (1/1) ... [2023-12-16 04:20:19,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463c97cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19, skipping insertion in model container [2023-12-16 04:20:19,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:20:18" (1/1) ... [2023-12-16 04:20:19,041 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:20:19,197 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-88.i[916,929] [2023-12-16 04:20:19,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:20:19,273 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:20:19,286 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-88.i[916,929] [2023-12-16 04:20:19,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:20:19,358 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:20:19,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19 WrapperNode [2023-12-16 04:20:19,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:20:19,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:20:19,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:20:19,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:20:19,366 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:20:19" (1/1) ... [2023-12-16 04:20:19,379 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:20:19" (1/1) ... [2023-12-16 04:20:19,418 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2023-12-16 04:20:19,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:20:19,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:20:19,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:20:19,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:20:19,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,487 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2023-12-16 04:20:19,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:20:19,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:20:19,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:20:19,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:20:19,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (1/1) ... [2023-12-16 04:20:19,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:20:19,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:19,589 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:20:19,600 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:20:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:20:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:20:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:20:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:20:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:20:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:20:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-16 04:20:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-16 04:20:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:20:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:20:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:20:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:20:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-16 04:20:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-16 04:20:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:20:19,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:20:19,754 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:20:19,755 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:20:20,172 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:20:20,217 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:20:20,218 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:20:20,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:20:20 BoogieIcfgContainer [2023-12-16 04:20:20,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:20:20,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:20:20,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:20:20,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:20:20,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:20:18" (1/3) ... [2023-12-16 04:20:20,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e36844a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:20:20, skipping insertion in model container [2023-12-16 04:20:20,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:19" (2/3) ... [2023-12-16 04:20:20,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e36844a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:20:20, skipping insertion in model container [2023-12-16 04:20:20,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:20:20" (3/3) ... [2023-12-16 04:20:20,225 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-88.i [2023-12-16 04:20:20,239 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:20:20,239 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:20:20,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:20:20,314 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;@68568a2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:20:20,315 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:20:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:20:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:20:20,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:20,332 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:20,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:20,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash -821374358, now seen corresponding path program 1 times [2023-12-16 04:20:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:20,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849930576] [2023-12-16 04:20:20,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:20,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849930576] [2023-12-16 04:20:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849930576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:20,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:20:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115595378] [2023-12-16 04:20:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:20,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:20:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:20:20,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:20:20,710 INFO L87 Difference]: Start difference. First operand has 104 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:20,748 INFO L93 Difference]: Finished difference Result 205 states and 327 transitions. [2023-12-16 04:20:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:20:20,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2023-12-16 04:20:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:20,757 INFO L225 Difference]: With dead ends: 205 [2023-12-16 04:20:20,757 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 04:20:20,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:20:20,763 INFO L413 NwaCegarLoop]: 147 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, 147 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:20:20,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 04:20:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-16 04:20:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:20:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2023-12-16 04:20:20,811 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 134 [2023-12-16 04:20:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:20,811 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2023-12-16 04:20:20,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2023-12-16 04:20:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:20:20,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:20,816 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:20,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:20:20,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:20,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash -157094916, now seen corresponding path program 1 times [2023-12-16 04:20:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:20,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230368425] [2023-12-16 04:20:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:21,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:21,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230368425] [2023-12-16 04:20:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230368425] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:21,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:21,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:20:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257562383] [2023-12-16 04:20:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:21,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:20:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:20:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:20:21,181 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:21,270 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2023-12-16 04:20:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:20:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-16 04:20:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:21,275 INFO L225 Difference]: With dead ends: 215 [2023-12-16 04:20:21,276 INFO L226 Difference]: Without dead ends: 114 [2023-12-16 04:20:21,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:20:21,277 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 21 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:21,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 432 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-16 04:20:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2023-12-16 04:20:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:20:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2023-12-16 04:20:21,289 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 134 [2023-12-16 04:20:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:21,290 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2023-12-16 04:20:21,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2023-12-16 04:20:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:20:21,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:21,295 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:21,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:20:21,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:21,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash -966441542, now seen corresponding path program 1 times [2023-12-16 04:20:21,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:21,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833600470] [2023-12-16 04:20:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:21,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833600470] [2023-12-16 04:20:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833600470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:21,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:21,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:20:21,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982556656] [2023-12-16 04:20:21,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:21,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:20:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:20:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:20:21,523 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:21,563 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2023-12-16 04:20:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:20:21,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-16 04:20:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:21,565 INFO L225 Difference]: With dead ends: 211 [2023-12-16 04:20:21,565 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 04:20:21,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:20:21,568 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:21,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 430 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 04:20:21,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-12-16 04:20:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:20:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2023-12-16 04:20:21,574 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 134 [2023-12-16 04:20:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:21,574 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2023-12-16 04:20:21,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2023-12-16 04:20:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:20:21,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:21,576 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:21,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:20:21,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:21,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -966381960, now seen corresponding path program 1 times [2023-12-16 04:20:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:21,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604924040] [2023-12-16 04:20:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:22,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:22,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604924040] [2023-12-16 04:20:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604924040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:22,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:22,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:20:22,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479762701] [2023-12-16 04:20:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:22,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:20:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:22,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:20:22,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:22,008 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:22,159 INFO L93 Difference]: Finished difference Result 267 states and 388 transitions. [2023-12-16 04:20:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:22,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-16 04:20:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:22,161 INFO L225 Difference]: With dead ends: 267 [2023-12-16 04:20:22,161 INFO L226 Difference]: Without dead ends: 162 [2023-12-16 04:20:22,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 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:20:22,168 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 192 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:22,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 493 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-16 04:20:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2023-12-16 04:20:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 105 states have internal predecessors, (141), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 04:20:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2023-12-16 04:20:22,192 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 189 transitions. Word has length 134 [2023-12-16 04:20:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:22,193 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 189 transitions. [2023-12-16 04:20:22,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 189 transitions. [2023-12-16 04:20:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 04:20:22,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:22,195 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:22,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:20:22,195 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:22,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash 866427206, now seen corresponding path program 1 times [2023-12-16 04:20:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:22,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004967820] [2023-12-16 04:20:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004967820] [2023-12-16 04:20:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004967820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:22,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:20:22,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516886977] [2023-12-16 04:20:22,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:22,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:20:22,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:22,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:20:22,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:22,410 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:22,466 INFO L93 Difference]: Finished difference Result 269 states and 386 transitions. [2023-12-16 04:20:22,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:22,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-16 04:20:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:22,469 INFO L225 Difference]: With dead ends: 269 [2023-12-16 04:20:22,469 INFO L226 Difference]: Without dead ends: 158 [2023-12-16 04:20:22,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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:20:22,470 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 89 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:22,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 588 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-16 04:20:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2023-12-16 04:20:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 108 states have internal predecessors, (144), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 04:20:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 192 transitions. [2023-12-16 04:20:22,483 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 192 transitions. Word has length 136 [2023-12-16 04:20:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:22,484 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 192 transitions. [2023-12-16 04:20:22,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2023-12-16 04:20:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:20:22,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:22,486 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:22,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:20:22,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:22,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash -321250840, now seen corresponding path program 1 times [2023-12-16 04:20:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777327058] [2023-12-16 04:20:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:22,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:22,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777327058] [2023-12-16 04:20:22,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777327058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:22,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:22,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121671132] [2023-12-16 04:20:22,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:22,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:22,912 INFO L87 Difference]: Start difference. First operand 134 states and 192 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:23,085 INFO L93 Difference]: Finished difference Result 282 states and 401 transitions. [2023-12-16 04:20:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:20:23,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-12-16 04:20:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:23,086 INFO L225 Difference]: With dead ends: 282 [2023-12-16 04:20:23,086 INFO L226 Difference]: Without dead ends: 168 [2023-12-16 04:20:23,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:20:23,087 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 184 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:23,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 653 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-16 04:20:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2023-12-16 04:20:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 106 states have internal predecessors, (141), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 04:20:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2023-12-16 04:20:23,092 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 137 [2023-12-16 04:20:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:23,092 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2023-12-16 04:20:23,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2023-12-16 04:20:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-16 04:20:23,093 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:23,093 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:23,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:20:23,093 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:23,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash -839850751, now seen corresponding path program 1 times [2023-12-16 04:20:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054492238] [2023-12-16 04:20:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054492238] [2023-12-16 04:20:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054492238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624557874] [2023-12-16 04:20:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:23,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:23,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:23,598 INFO L87 Difference]: Start difference. First operand 132 states and 189 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:23,674 INFO L93 Difference]: Finished difference Result 337 states and 475 transitions. [2023-12-16 04:20:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:20:23,674 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2023-12-16 04:20:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:23,675 INFO L225 Difference]: With dead ends: 337 [2023-12-16 04:20:23,675 INFO L226 Difference]: Without dead ends: 225 [2023-12-16 04:20:23,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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:20:23,676 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 201 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:23,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 592 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-16 04:20:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 198. [2023-12-16 04:20:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 169 states have internal predecessors, (227), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-16 04:20:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 279 transitions. [2023-12-16 04:20:23,684 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 279 transitions. Word has length 138 [2023-12-16 04:20:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:23,685 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 279 transitions. [2023-12-16 04:20:23,685 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 279 transitions. [2023-12-16 04:20:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-16 04:20:23,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:23,686 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:23,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:20:23,686 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:23,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash -138250877, now seen corresponding path program 1 times [2023-12-16 04:20:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032104149] [2023-12-16 04:20:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:24,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032104149] [2023-12-16 04:20:24,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032104149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:24,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:24,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:24,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905017860] [2023-12-16 04:20:24,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:24,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:24,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:24,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:24,077 INFO L87 Difference]: Start difference. First operand 198 states and 279 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:24,173 INFO L93 Difference]: Finished difference Result 513 states and 720 transitions. [2023-12-16 04:20:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:20:24,173 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2023-12-16 04:20:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:24,175 INFO L225 Difference]: With dead ends: 513 [2023-12-16 04:20:24,175 INFO L226 Difference]: Without dead ends: 339 [2023-12-16 04:20:24,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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:20:24,176 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 193 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:24,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 545 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-12-16 04:20:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 198. [2023-12-16 04:20:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 169 states have internal predecessors, (227), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-16 04:20:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 279 transitions. [2023-12-16 04:20:24,189 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 279 transitions. Word has length 138 [2023-12-16 04:20:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:24,190 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 279 transitions. [2023-12-16 04:20:24,190 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 279 transitions. [2023-12-16 04:20:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:20:24,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:24,191 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:24,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:20:24,191 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:24,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1939276222, now seen corresponding path program 1 times [2023-12-16 04:20:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415624400] [2023-12-16 04:20:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:26,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415624400] [2023-12-16 04:20:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415624400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:26,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:20:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265056166] [2023-12-16 04:20:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:26,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:20:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:26,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:20:26,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:20:26,211 INFO L87 Difference]: Start difference. First operand 198 states and 279 transitions. Second operand has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-16 04:20:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:26,646 INFO L93 Difference]: Finished difference Result 535 states and 747 transitions. [2023-12-16 04:20:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:20:26,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) Word has length 139 [2023-12-16 04:20:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:26,649 INFO L225 Difference]: With dead ends: 535 [2023-12-16 04:20:26,649 INFO L226 Difference]: Without dead ends: 361 [2023-12-16 04:20:26,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:20:26,650 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 175 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:26,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1300 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:20:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-12-16 04:20:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 332. [2023-12-16 04:20:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 283 states have (on average 1.3392226148409894) internal successors, (379), 287 states have internal predecessors, (379), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-16 04:20:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 461 transitions. [2023-12-16 04:20:26,706 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 461 transitions. Word has length 139 [2023-12-16 04:20:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:26,706 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 461 transitions. [2023-12-16 04:20:26,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-16 04:20:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 461 transitions. [2023-12-16 04:20:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:20:26,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:26,708 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:26,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:20:26,708 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:26,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1974873302, now seen corresponding path program 1 times [2023-12-16 04:20:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:26,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514745601] [2023-12-16 04:20:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514745601] [2023-12-16 04:20:27,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514745601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:27,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:27,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:20:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860272990] [2023-12-16 04:20:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:27,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:20:27,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:27,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:20:27,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:27,194 INFO L87 Difference]: Start difference. First operand 332 states and 461 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:27,383 INFO L93 Difference]: Finished difference Result 1004 states and 1387 transitions. [2023-12-16 04:20:27,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:20:27,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-12-16 04:20:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:27,387 INFO L225 Difference]: With dead ends: 1004 [2023-12-16 04:20:27,387 INFO L226 Difference]: Without dead ends: 696 [2023-12-16 04:20:27,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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:20:27,388 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 177 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:27,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 635 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2023-12-16 04:20:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 582. [2023-12-16 04:20:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 514 states have (on average 1.3463035019455254) internal successors, (692), 522 states have internal predecessors, (692), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 47 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-16 04:20:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 802 transitions. [2023-12-16 04:20:27,428 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 802 transitions. Word has length 140 [2023-12-16 04:20:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:27,428 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 802 transitions. [2023-12-16 04:20:27,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 802 transitions. [2023-12-16 04:20:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:20:27,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:27,430 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:20:27,430 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:27,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1299025640, now seen corresponding path program 1 times [2023-12-16 04:20:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:27,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334442105] [2023-12-16 04:20:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:27,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334442105] [2023-12-16 04:20:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334442105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:27,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:27,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331795958] [2023-12-16 04:20:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:27,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:27,750 INFO L87 Difference]: Start difference. First operand 582 states and 802 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:27,904 INFO L93 Difference]: Finished difference Result 1605 states and 2188 transitions. [2023-12-16 04:20:27,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:20:27,904 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2023-12-16 04:20:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:27,908 INFO L225 Difference]: With dead ends: 1605 [2023-12-16 04:20:27,908 INFO L226 Difference]: Without dead ends: 1051 [2023-12-16 04:20:27,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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:20:27,910 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 130 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:27,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1096 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2023-12-16 04:20:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 467. [2023-12-16 04:20:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 407 states have (on average 1.348894348894349) internal successors, (549), 411 states have internal predecessors, (549), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-16 04:20:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 643 transitions. [2023-12-16 04:20:27,951 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 643 transitions. Word has length 140 [2023-12-16 04:20:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:27,951 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 643 transitions. [2023-12-16 04:20:27,952 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 643 transitions. [2023-12-16 04:20:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:20:27,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:27,953 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:20:27,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:27,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1721727466, now seen corresponding path program 1 times [2023-12-16 04:20:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:27,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840890475] [2023-12-16 04:20:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:27,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:30,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 51 proven. 39 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-12-16 04:20:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840890475] [2023-12-16 04:20:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840890475] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:20:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840103467] [2023-12-16 04:20:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:30,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:30,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:30,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:30,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:20:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:30,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 04:20:30,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:30,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-16 04:20:30,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:20:30,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 32 [2023-12-16 04:20:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:20:30,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:20:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840103467] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:20:30,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:20:30,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21, 11] total 27 [2023-12-16 04:20:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442988013] [2023-12-16 04:20:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:30,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:20:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:30,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:20:30,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2023-12-16 04:20:30,977 INFO L87 Difference]: Start difference. First operand 467 states and 643 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:31,583 INFO L93 Difference]: Finished difference Result 1012 states and 1395 transitions. [2023-12-16 04:20:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:20:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-12-16 04:20:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:31,588 INFO L225 Difference]: With dead ends: 1012 [2023-12-16 04:20:31,588 INFO L226 Difference]: Without dead ends: 573 [2023-12-16 04:20:31,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 310 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 04:20:31,590 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 245 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:31,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1503 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:20:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-12-16 04:20:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 461. [2023-12-16 04:20:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 401 states have (on average 1.3491271820448878) internal successors, (541), 405 states have internal predecessors, (541), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-16 04:20:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 635 transitions. [2023-12-16 04:20:31,622 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 635 transitions. Word has length 140 [2023-12-16 04:20:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:31,623 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 635 transitions. [2023-12-16 04:20:31,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 635 transitions. [2023-12-16 04:20:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:20:31,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:31,624 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 04:20:31,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 04:20:31,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:31,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1356592426, now seen corresponding path program 1 times [2023-12-16 04:20:31,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:31,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057654098] [2023-12-16 04:20:31,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:31,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:20:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057654098] [2023-12-16 04:20:33,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057654098] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:20:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080380622] [2023-12-16 04:20:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:33,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:33,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:33,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:20:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:33,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 04:20:33,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:34,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2023-12-16 04:20:34,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:20:34,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2023-12-16 04:20:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:20:34,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:20:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080380622] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:20:34,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:20:34,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18, 11] total 29 [2023-12-16 04:20:34,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341219010] [2023-12-16 04:20:34,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:34,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:20:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:20:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2023-12-16 04:20:34,578 INFO L87 Difference]: Start difference. First operand 461 states and 635 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:35,246 INFO L93 Difference]: Finished difference Result 1194 states and 1639 transitions. [2023-12-16 04:20:35,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:20:35,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-12-16 04:20:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:35,249 INFO L225 Difference]: With dead ends: 1194 [2023-12-16 04:20:35,249 INFO L226 Difference]: Without dead ends: 761 [2023-12-16 04:20:35,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 04:20:35,252 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 300 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:35,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1521 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:20:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2023-12-16 04:20:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 463. [2023-12-16 04:20:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 403 states have (on average 1.347394540942928) internal successors, (543), 407 states have internal predecessors, (543), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-16 04:20:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 637 transitions. [2023-12-16 04:20:35,285 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 637 transitions. Word has length 140 [2023-12-16 04:20:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:35,285 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 637 transitions. [2023-12-16 04:20:35,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 637 transitions. [2023-12-16 04:20:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:20:35,287 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:35,287 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:35,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:35,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-16 04:20:35,493 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:35,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash 335524072, now seen corresponding path program 1 times [2023-12-16 04:20:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:35,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193438648] [2023-12-16 04:20:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:35,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193438648] [2023-12-16 04:20:35,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193438648] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:35,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:35,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:20:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519763793] [2023-12-16 04:20:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:35,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:20:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:35,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:20:35,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:35,879 INFO L87 Difference]: Start difference. First operand 463 states and 637 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:36,057 INFO L93 Difference]: Finished difference Result 1072 states and 1469 transitions. [2023-12-16 04:20:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:36,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-12-16 04:20:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:36,059 INFO L225 Difference]: With dead ends: 1072 [2023-12-16 04:20:36,059 INFO L226 Difference]: Without dead ends: 637 [2023-12-16 04:20:36,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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:20:36,061 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 122 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:36,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 744 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2023-12-16 04:20:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 435. [2023-12-16 04:20:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 375 states have (on average 1.3413333333333333) internal successors, (503), 379 states have internal predecessors, (503), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-16 04:20:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 597 transitions. [2023-12-16 04:20:36,100 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 597 transitions. Word has length 140 [2023-12-16 04:20:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:36,100 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 597 transitions. [2023-12-16 04:20:36,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 597 transitions. [2023-12-16 04:20:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:20:36,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:36,101 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:36,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:20:36,101 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:36,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1189684743, now seen corresponding path program 1 times [2023-12-16 04:20:36,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:36,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793572272] [2023-12-16 04:20:36,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:36,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:36,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793572272] [2023-12-16 04:20:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793572272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:36,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:36,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:20:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024498903] [2023-12-16 04:20:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:36,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:20:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:36,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:20:36,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:20:36,183 INFO L87 Difference]: Start difference. First operand 435 states and 597 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:36,220 INFO L93 Difference]: Finished difference Result 846 states and 1166 transitions. [2023-12-16 04:20:36,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:20:36,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2023-12-16 04:20:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:36,222 INFO L225 Difference]: With dead ends: 846 [2023-12-16 04:20:36,222 INFO L226 Difference]: Without dead ends: 439 [2023-12-16 04:20:36,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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:20:36,224 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:36,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-12-16 04:20:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2023-12-16 04:20:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 379 states have (on average 1.3377308707124012) internal successors, (507), 383 states have internal predecessors, (507), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-16 04:20:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 601 transitions. [2023-12-16 04:20:36,252 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 601 transitions. Word has length 141 [2023-12-16 04:20:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:36,252 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 601 transitions. [2023-12-16 04:20:36,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 601 transitions. [2023-12-16 04:20:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:20:36,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:36,254 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:36,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:20:36,254 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:36,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1844162941, now seen corresponding path program 1 times [2023-12-16 04:20:36,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:36,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883632424] [2023-12-16 04:20:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:36,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:36,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:36,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883632424] [2023-12-16 04:20:36,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883632424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:36,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:36,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:20:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628845248] [2023-12-16 04:20:36,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:36,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:20:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:36,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:20:36,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:20:36,321 INFO L87 Difference]: Start difference. First operand 439 states and 601 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:36,356 INFO L93 Difference]: Finished difference Result 916 states and 1258 transitions. [2023-12-16 04:20:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:20:36,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2023-12-16 04:20:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:36,358 INFO L225 Difference]: With dead ends: 916 [2023-12-16 04:20:36,359 INFO L226 Difference]: Without dead ends: 505 [2023-12-16 04:20:36,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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:20:36,360 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 20 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 283 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:20:36,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 283 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-12-16 04:20:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 443. [2023-12-16 04:20:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 383 states have (on average 1.3342036553524803) internal successors, (511), 387 states have internal predecessors, (511), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-16 04:20:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 605 transitions. [2023-12-16 04:20:36,388 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 605 transitions. Word has length 141 [2023-12-16 04:20:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:36,389 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 605 transitions. [2023-12-16 04:20:36,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 605 transitions. [2023-12-16 04:20:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:20:36,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:36,390 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:36,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:20:36,390 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:36,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:36,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1351987634, now seen corresponding path program 1 times [2023-12-16 04:20:36,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:36,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911423277] [2023-12-16 04:20:36,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:36,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:36,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:36,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911423277] [2023-12-16 04:20:36,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911423277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:36,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:36,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:20:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558433055] [2023-12-16 04:20:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:36,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:20:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:36,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:20:36,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:36,548 INFO L87 Difference]: Start difference. First operand 443 states and 605 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:36,605 INFO L93 Difference]: Finished difference Result 937 states and 1287 transitions. [2023-12-16 04:20:36,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:20:36,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2023-12-16 04:20:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:36,608 INFO L225 Difference]: With dead ends: 937 [2023-12-16 04:20:36,608 INFO L226 Difference]: Without dead ends: 522 [2023-12-16 04:20:36,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 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:20:36,609 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 139 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:36,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 745 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-12-16 04:20:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 475. [2023-12-16 04:20:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 404 states have (on average 1.316831683168317) internal successors, (532), 408 states have internal predecessors, (532), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2023-12-16 04:20:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 646 transitions. [2023-12-16 04:20:36,639 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 646 transitions. Word has length 141 [2023-12-16 04:20:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:36,640 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 646 transitions. [2023-12-16 04:20:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 646 transitions. [2023-12-16 04:20:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:20:36,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:36,641 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:36,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:20:36,642 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:36,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:36,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1294669750, now seen corresponding path program 1 times [2023-12-16 04:20:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:36,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046082649] [2023-12-16 04:20:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:36,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046082649] [2023-12-16 04:20:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046082649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:37,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:37,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759226895] [2023-12-16 04:20:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:37,109 INFO L87 Difference]: Start difference. First operand 475 states and 646 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:37,232 INFO L93 Difference]: Finished difference Result 493 states and 665 transitions. [2023-12-16 04:20:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:37,233 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2023-12-16 04:20:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:37,234 INFO L225 Difference]: With dead ends: 493 [2023-12-16 04:20:37,234 INFO L226 Difference]: Without dead ends: 491 [2023-12-16 04:20:37,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 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:20:37,235 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 82 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:37,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 768 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-16 04:20:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2023-12-16 04:20:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 418 states have (on average 1.30622009569378) internal successors, (546), 422 states have internal predecessors, (546), 57 states have call successors, (57), 15 states have call predecessors, (57), 15 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2023-12-16 04:20:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 660 transitions. [2023-12-16 04:20:37,272 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 660 transitions. Word has length 141 [2023-12-16 04:20:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:37,272 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 660 transitions. [2023-12-16 04:20:37,273 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 660 transitions. [2023-12-16 04:20:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:20:37,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:37,274 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:20:37,274 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:37,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1294729332, now seen corresponding path program 1 times [2023-12-16 04:20:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16234212] [2023-12-16 04:20:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:20:37,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:37,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16234212] [2023-12-16 04:20:37,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16234212] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:20:37,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312370202] [2023-12-16 04:20:37,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:37,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:37,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:37,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:37,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:20:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:38,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-16 04:20:38,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:38,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 04:20:38,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 04:20:38,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 04:20:38,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 04:20:38,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:20:38,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2023-12-16 04:20:38,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 04:20:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2023-12-16 04:20:38,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:20:38,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-12-16 04:20:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-16 04:20:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312370202] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:20:38,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:20:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2023-12-16 04:20:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436401767] [2023-12-16 04:20:38,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:20:38,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 04:20:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 04:20:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:20:38,811 INFO L87 Difference]: Start difference. First operand 491 states and 660 transitions. Second operand has 23 states, 19 states have (on average 6.842105263157895) internal successors, (130), 23 states have internal predecessors, (130), 11 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 7 states have call predecessors, (51), 11 states have call successors, (51) [2023-12-16 04:20:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:39,751 INFO L93 Difference]: Finished difference Result 1206 states and 1596 transitions. [2023-12-16 04:20:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 04:20:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 6.842105263157895) internal successors, (130), 23 states have internal predecessors, (130), 11 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 7 states have call predecessors, (51), 11 states have call successors, (51) Word has length 141 [2023-12-16 04:20:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:39,755 INFO L225 Difference]: With dead ends: 1206 [2023-12-16 04:20:39,755 INFO L226 Difference]: Without dead ends: 767 [2023-12-16 04:20:39,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=955, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 04:20:39,757 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 166 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:39,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1086 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:20:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2023-12-16 04:20:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 708. [2023-12-16 04:20:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 597 states have (on average 1.2948073701842546) internal successors, (773), 602 states have internal predecessors, (773), 85 states have call successors, (85), 25 states have call predecessors, (85), 25 states have return successors, (85), 80 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-16 04:20:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 943 transitions. [2023-12-16 04:20:39,816 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 943 transitions. Word has length 141 [2023-12-16 04:20:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:39,817 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 943 transitions. [2023-12-16 04:20:39,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 6.842105263157895) internal successors, (130), 23 states have internal predecessors, (130), 11 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 7 states have call predecessors, (51), 11 states have call successors, (51) [2023-12-16 04:20:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 943 transitions. [2023-12-16 04:20:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:20:39,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:39,818 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:40,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:40,025 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:40,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1998149295, now seen corresponding path program 1 times [2023-12-16 04:20:40,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:40,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682217491] [2023-12-16 04:20:40,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:40,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682217491] [2023-12-16 04:20:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682217491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:40,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:20:40,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317102454] [2023-12-16 04:20:40,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:40,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:20:40,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:40,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:20:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:20:40,659 INFO L87 Difference]: Start difference. First operand 708 states and 943 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:41,243 INFO L93 Difference]: Finished difference Result 1574 states and 2085 transitions. [2023-12-16 04:20:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:20:41,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-12-16 04:20:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:41,246 INFO L225 Difference]: With dead ends: 1574 [2023-12-16 04:20:41,246 INFO L226 Difference]: Without dead ends: 922 [2023-12-16 04:20:41,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:20:41,248 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 230 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:41,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 664 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:20:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-12-16 04:20:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 764. [2023-12-16 04:20:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 652 states have (on average 1.3006134969325154) internal successors, (848), 657 states have internal predecessors, (848), 85 states have call successors, (85), 26 states have call predecessors, (85), 26 states have return successors, (85), 80 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-16 04:20:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1018 transitions. [2023-12-16 04:20:41,313 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1018 transitions. Word has length 143 [2023-12-16 04:20:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:41,313 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 1018 transitions. [2023-12-16 04:20:41,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1018 transitions. [2023-12-16 04:20:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:20:41,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:41,314 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:20:41,314 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:41,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2020781549, now seen corresponding path program 1 times [2023-12-16 04:20:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:41,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053241236] [2023-12-16 04:20:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:41,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053241236] [2023-12-16 04:20:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053241236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:41,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:41,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:20:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751076471] [2023-12-16 04:20:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:41,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:20:41,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:41,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:20:41,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:20:41,520 INFO L87 Difference]: Start difference. First operand 764 states and 1018 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:41,709 INFO L93 Difference]: Finished difference Result 1358 states and 1812 transitions. [2023-12-16 04:20:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:20:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2023-12-16 04:20:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:41,712 INFO L225 Difference]: With dead ends: 1358 [2023-12-16 04:20:41,712 INFO L226 Difference]: Without dead ends: 654 [2023-12-16 04:20:41,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:20:41,714 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 95 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:41,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 309 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2023-12-16 04:20:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 627. [2023-12-16 04:20:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 537 states have (on average 1.303538175046555) internal successors, (700), 541 states have internal predecessors, (700), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-16 04:20:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 836 transitions. [2023-12-16 04:20:41,770 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 836 transitions. Word has length 143 [2023-12-16 04:20:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:41,770 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 836 transitions. [2023-12-16 04:20:41,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 836 transitions. [2023-12-16 04:20:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:20:41,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:41,771 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:20:41,771 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:41,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1919180117, now seen corresponding path program 1 times [2023-12-16 04:20:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545997187] [2023-12-16 04:20:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545997187] [2023-12-16 04:20:42,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545997187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:42,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:42,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520926791] [2023-12-16 04:20:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:42,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:42,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:42,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:42,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:42,026 INFO L87 Difference]: Start difference. First operand 627 states and 836 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:42,152 INFO L93 Difference]: Finished difference Result 1237 states and 1646 transitions. [2023-12-16 04:20:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-12-16 04:20:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:42,155 INFO L225 Difference]: With dead ends: 1237 [2023-12-16 04:20:42,155 INFO L226 Difference]: Without dead ends: 798 [2023-12-16 04:20:42,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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:20:42,158 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 77 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:42,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 705 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2023-12-16 04:20:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 593. [2023-12-16 04:20:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 503 states have (on average 1.2902584493041749) internal successors, (649), 507 states have internal predecessors, (649), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-16 04:20:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 785 transitions. [2023-12-16 04:20:42,215 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 785 transitions. Word has length 143 [2023-12-16 04:20:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:42,215 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 785 transitions. [2023-12-16 04:20:42,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 785 transitions. [2023-12-16 04:20:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:20:42,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:42,216 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 04:20:42,217 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:42,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:42,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1981420393, now seen corresponding path program 1 times [2023-12-16 04:20:42,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677561709] [2023-12-16 04:20:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:42,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677561709] [2023-12-16 04:20:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677561709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:42,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:42,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530631752] [2023-12-16 04:20:42,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:42,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:42,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:42,458 INFO L87 Difference]: Start difference. First operand 593 states and 785 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:42,584 INFO L93 Difference]: Finished difference Result 1000 states and 1327 transitions. [2023-12-16 04:20:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:42,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-12-16 04:20:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:42,587 INFO L225 Difference]: With dead ends: 1000 [2023-12-16 04:20:42,587 INFO L226 Difference]: Without dead ends: 595 [2023-12-16 04:20:42,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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:20:42,588 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 106 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:42,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 876 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-12-16 04:20:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2023-12-16 04:20:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 503 states have (on average 1.2823061630218688) internal successors, (645), 507 states have internal predecessors, (645), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-16 04:20:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 781 transitions. [2023-12-16 04:20:42,638 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 781 transitions. Word has length 143 [2023-12-16 04:20:42,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:42,638 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 781 transitions. [2023-12-16 04:20:42,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:20:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 781 transitions. [2023-12-16 04:20:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 04:20:42,639 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:42,639 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 04:20:42,639 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:42,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash 324115965, now seen corresponding path program 1 times [2023-12-16 04:20:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778583143] [2023-12-16 04:20:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:20:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:20:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:20:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:20:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:20:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:20:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:20:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:20:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:20:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:20:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:20:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:20:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:20:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:20:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:20:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:20:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:20:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:20:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778583143] [2023-12-16 04:20:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778583143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:42,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:20:42,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033545327] [2023-12-16 04:20:42,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:42,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:20:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:42,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:20:42,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:42,843 INFO L87 Difference]: Start difference. First operand 593 states and 781 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:43,058 INFO L93 Difference]: Finished difference Result 1522 states and 1994 transitions. [2023-12-16 04:20:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:43,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2023-12-16 04:20:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:43,062 INFO L225 Difference]: With dead ends: 1522 [2023-12-16 04:20:43,062 INFO L226 Difference]: Without dead ends: 969 [2023-12-16 04:20:43,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:43,064 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 146 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:43,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 591 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2023-12-16 04:20:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 774. [2023-12-16 04:20:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 655 states have (on average 1.2687022900763358) internal successors, (831), 661 states have internal predecessors, (831), 90 states have call successors, (90), 28 states have call predecessors, (90), 28 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:20:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1011 transitions. [2023-12-16 04:20:43,151 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1011 transitions. Word has length 145 [2023-12-16 04:20:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:43,151 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1011 transitions. [2023-12-16 04:20:43,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:20:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1011 transitions. [2023-12-16 04:20:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 04:20:43,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:43,153 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 04:20:43,153 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:43,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:43,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1230653302, now seen corresponding path program 1 times [2023-12-16 04:20:43,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:43,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227648484] [2023-12-16 04:20:43,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:20:43,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:20:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:20:43,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:20:43,328 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:20:43,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:20:43,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 04:20:43,332 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] [2023-12-16 04:20:43,334 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:20:43,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:20:43 BoogieIcfgContainer [2023-12-16 04:20:43,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:20:43,402 INFO L158 Benchmark]: Toolchain (without parser) took 24404.37ms. Allocated memory was 265.3MB in the beginning and 943.7MB in the end (delta: 678.4MB). Free memory was 212.4MB in the beginning and 622.9MB in the end (delta: -410.5MB). Peak memory consumption was 269.0MB. Max. memory is 8.0GB. [2023-12-16 04:20:43,403 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 127.0MB in the beginning and 126.9MB in the end (delta: 66.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:20:43,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.51ms. Allocated memory is still 265.3MB. Free memory was 211.8MB in the beginning and 196.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:20:43,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.28ms. Allocated memory is still 265.3MB. Free memory was 196.1MB in the beginning and 192.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:20:43,403 INFO L158 Benchmark]: Boogie Preprocessor took 139.38ms. Allocated memory is still 265.3MB. Free memory was 192.4MB in the beginning and 187.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:20:43,403 INFO L158 Benchmark]: RCFGBuilder took 659.07ms. Allocated memory is still 265.3MB. Free memory was 187.2MB in the beginning and 151.0MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-12-16 04:20:43,403 INFO L158 Benchmark]: TraceAbstraction took 23182.43ms. Allocated memory was 265.3MB in the beginning and 943.7MB in the end (delta: 678.4MB). Free memory was 150.5MB in the beginning and 622.9MB in the end (delta: -472.4MB). Peak memory consumption was 207.1MB. Max. memory is 8.0GB. [2023-12-16 04:20:43,404 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 127.0MB in the beginning and 126.9MB in the end (delta: 66.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 358.51ms. Allocated memory is still 265.3MB. Free memory was 211.8MB in the beginning and 196.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.28ms. Allocated memory is still 265.3MB. Free memory was 196.1MB in the beginning and 192.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 139.38ms. Allocated memory is still 265.3MB. Free memory was 192.4MB in the beginning and 187.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 659.07ms. Allocated memory is still 265.3MB. Free memory was 187.2MB in the beginning and 151.0MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 23182.43ms. Allocated memory was 265.3MB in the beginning and 943.7MB in the end (delta: 678.4MB). Free memory was 150.5MB in the beginning and 622.9MB in the end (delta: -472.4MB). Peak memory consumption was 207.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of bitwise operation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 64 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { -16 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { -16 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L43] signed short int last_1_signed_short_int_Array_0_0_ = -16; [L44] unsigned char last_1_unsigned_char_Array_0_0_ = 0; [L45] unsigned long int last_1_unsigned_long_int_Array_0_0__1_ = 25; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L103] EXPR signed_short_int_Array_0[0] [L103] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L104] EXPR unsigned_char_Array_0[0] [L104] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L105] EXPR unsigned_long_int_Array_0[0][1] [L105] last_1_unsigned_long_int_Array_0_0__1_ = unsigned_long_int_Array_0[0][1] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L81] float_Array_0[1] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L86] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L89] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L92] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L95] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L98] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L99] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L116] RET updateVariables() [L117] CALL step() [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] COND FALSE !(((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) [L56] EXPR signed_char_Array_0[0][1] [L56] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L58] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L58] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L61] EXPR unsigned_long_int_Array_0[0][0] [L61] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L61] COND TRUE unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0] [L62] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L62] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) [L62] EXPR signed_char_Array_0[1][0] [L62] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L62] signed_long_int_Array_0[0] = ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))) [L64] signed_short_int_Array_0[0] = 2 [L65] EXPR float_Array_0[1] [L65] float_Array_0[0] = float_Array_0[1] [L66] EXPR unsigned_char_Array_0[1] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L67] EXPR signed_char_Array_0[1][0] [L67] EXPR signed_char_Array_0[1][1] [L67] unsigned char stepLocal_0 = signed_char_Array_0[1][0] < signed_char_Array_0[1][1]; [L68] stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=0, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L68] stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L68] COND FALSE !(stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) [L71] EXPR unsigned_long_int_Array_0[1][1] [L71] EXPR unsigned_long_int_Array_0[1][0] [L71] unsigned_long_int_Array_0[0][1] = (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] [L108] EXPR BOOL_unsigned_char_Array_0[1] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L108] EXPR signed_char_Array_0[1][1] [L108] EXPR signed_char_Array_0[0][1] [L108] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) [L108] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1 [L108] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) [L108] EXPR signed_char_Array_0[1][0] [L108] EXPR signed_char_Array_0[1][1] [L108] EXPR (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))) [L108] EXPR unsigned_long_int_Array_0[0][1] [L108] EXPR unsigned_long_int_Array_0[1][1] [L108] EXPR unsigned_long_int_Array_0[1][0] [L108] EXPR ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) [L108] EXPR unsigned_long_int_Array_0[0][0] [L108] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1 [L108] EXPR signed_long_int_Array_0[0] [L108] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) [L108] EXPR signed_char_Array_0[1][0] [L108] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) [L108] EXPR signed_short_int_Array_0[0] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L108] EXPR float_Array_0[0] [L108] EXPR float_Array_0[1] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108-L109] return (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 25, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3122 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3093 mSDsluCounter, 16988 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12835 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4507 IncrementalHoareTripleChecker+Invalid, 4658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 4153 mSDtfsCounter, 4507 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1933 GetRequests, 1721 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=774occurred in iteration=24, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 2365 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 3912 NumberOfCodeBlocks, 3912 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4158 ConstructedInterpolants, 0 QuantifiedInterpolants, 20343 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1556 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 30 InterpolantComputations, 23 PerfectInterpolantSequences, 16125/16320 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:20:43,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...