/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:20:32,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:20:32,527 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-19 15:20:32,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:20:32,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:20:32,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:20:32,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:20:32,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:20:32,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:20:32,556 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:20:32,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:20:32,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:20:32,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:20:32,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:20:32,558 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:20:32,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:20:32,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:20:32,559 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:20:32,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:20:32,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:20:32,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:20:32,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:20:32,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:20:32,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:20:32,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:20:32,560 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:20:32,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:20:32,560 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:20:32,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:20:32,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:20:32,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:20:32,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:20:32,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:20:32,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:20:32,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:20:32,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:20:32,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:20:32,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:20:32,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:20:32,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:20:32,563 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:20:32,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:20:32,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:20:32,563 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 15:20:32,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:20:32,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:20:32,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:20:32,765 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:20:32,765 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:20:32,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2023-12-19 15:20:33,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:20:33,873 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:20:33,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2023-12-19 15:20:33,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc127367/b1075e1ea6824af380bdb02ec2dd1dca/FLAGb559d26fa [2023-12-19 15:20:33,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc127367/b1075e1ea6824af380bdb02ec2dd1dca [2023-12-19 15:20:33,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:20:33,891 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:20:33,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:20:33,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:20:33,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:20:33,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:20:33" (1/1) ... [2023-12-19 15:20:33,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d1faa78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:33, skipping insertion in model container [2023-12-19 15:20:33,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:20:33" (1/1) ... [2023-12-19 15:20:33,926 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:20:34,012 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2023-12-19 15:20:34,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:20:34,065 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:20:34,072 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2023-12-19 15:20:34,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:20:34,114 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:20:34,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34 WrapperNode [2023-12-19 15:20:34,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:20:34,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:20:34,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:20:34,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:20:34,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,170 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 581 [2023-12-19 15:20:34,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:20:34,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:20:34,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:20:34,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:20:34,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,197 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2023-12-19 15:20:34,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:20:34,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:20:34,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:20:34,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:20:34,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (1/1) ... [2023-12-19 15:20:34,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:20:34,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:34,280 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-19 15:20:34,309 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-19 15:20:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:20:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:20:34,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:20:34,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:20:34,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:20:34,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:20:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:20:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:20:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:20:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:20:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:20:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:20:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:20:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:20:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:20:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:20:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:20:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:20:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:20:34,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:20:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:20:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:20:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:20:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:20:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:20:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:20:34,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:20:34,434 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:20:34,435 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:20:34,830 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:20:34,861 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:20:34,861 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:20:34,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:20:34 BoogieIcfgContainer [2023-12-19 15:20:34,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:20:34,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:20:34,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:20:34,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:20:34,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:20:33" (1/3) ... [2023-12-19 15:20:34,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28558ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:20:34, skipping insertion in model container [2023-12-19 15:20:34,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:34" (2/3) ... [2023-12-19 15:20:34,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28558ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:20:34, skipping insertion in model container [2023-12-19 15:20:34,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:20:34" (3/3) ... [2023-12-19 15:20:34,866 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2023-12-19 15:20:34,877 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:20:34,877 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:20:34,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:20:34,910 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;@24777b9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:20:34,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:20:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 93 states have (on average 1.4838709677419355) internal successors, (138), 94 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:20:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:20:34,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:34,923 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:34,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:34,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:34,927 INFO L85 PathProgramCache]: Analyzing trace with hash -863600241, now seen corresponding path program 1 times [2023-12-19 15:20:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:34,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648060915] [2023-12-19 15:20:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:35,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:35,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648060915] [2023-12-19 15:20:35,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648060915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:35,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:35,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:20:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562159473] [2023-12-19 15:20:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:35,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:20:35,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:20:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:20:35,269 INFO L87 Difference]: Start difference. First operand has 115 states, 93 states have (on average 1.4838709677419355) internal successors, (138), 94 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 15:20:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:35,319 INFO L93 Difference]: Finished difference Result 227 states and 369 transitions. [2023-12-19 15:20:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:20:35,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2023-12-19 15:20:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:35,328 INFO L225 Difference]: With dead ends: 227 [2023-12-19 15:20:35,328 INFO L226 Difference]: Without dead ends: 113 [2023-12-19 15:20:35,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-19 15:20:35,334 INFO L413 NwaCegarLoop]: 167 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, 167 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-19 15:20:35,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-19 15:20:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-19 15:20:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:20:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2023-12-19 15:20:35,368 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 146 [2023-12-19 15:20:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:35,368 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2023-12-19 15:20:35,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 15:20:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2023-12-19 15:20:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:20:35,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:35,371 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:35,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:20:35,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:35,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1384676501, now seen corresponding path program 1 times [2023-12-19 15:20:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:35,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80619955] [2023-12-19 15:20:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:35,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:35,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80619955] [2023-12-19 15:20:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80619955] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031714684] [2023-12-19 15:20:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:35,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:35,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:35,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:35,597 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:35,644 INFO L93 Difference]: Finished difference Result 226 states and 343 transitions. [2023-12-19 15:20:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:35,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-12-19 15:20:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:35,646 INFO L225 Difference]: With dead ends: 226 [2023-12-19 15:20:35,646 INFO L226 Difference]: Without dead ends: 114 [2023-12-19 15:20:35,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 15:20:35,647 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:35,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-19 15:20:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-12-19 15:20:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:20:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2023-12-19 15:20:35,657 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 146 [2023-12-19 15:20:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:35,658 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2023-12-19 15:20:35,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2023-12-19 15:20:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:20:35,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:35,660 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:35,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:20:35,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:35,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -304267241, now seen corresponding path program 1 times [2023-12-19 15:20:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828608863] [2023-12-19 15:20:35,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:37,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:37,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828608863] [2023-12-19 15:20:37,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828608863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:37,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:37,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:20:37,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500826787] [2023-12-19 15:20:37,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:37,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:20:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:37,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:20:37,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:20:37,636 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:38,679 INFO L93 Difference]: Finished difference Result 521 states and 790 transitions. [2023-12-19 15:20:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:20:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-12-19 15:20:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:38,685 INFO L225 Difference]: With dead ends: 521 [2023-12-19 15:20:38,685 INFO L226 Difference]: Without dead ends: 408 [2023-12-19 15:20:38,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2023-12-19 15:20:38,686 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 738 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:38,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1192 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:20:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-12-19 15:20:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 192. [2023-12-19 15:20:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 150 states have (on average 1.4133333333333333) internal successors, (212), 150 states have internal predecessors, (212), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 15:20:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 288 transitions. [2023-12-19 15:20:38,716 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 288 transitions. Word has length 146 [2023-12-19 15:20:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:38,717 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 288 transitions. [2023-12-19 15:20:38,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 288 transitions. [2023-12-19 15:20:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:20:38,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:38,719 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:38,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:20:38,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:38,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -46101803, now seen corresponding path program 1 times [2023-12-19 15:20:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232459819] [2023-12-19 15:20:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232459819] [2023-12-19 15:20:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232459819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:20:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449871853] [2023-12-19 15:20:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:39,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:20:39,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:39,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:20:39,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:20:39,275 INFO L87 Difference]: Start difference. First operand 192 states and 288 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:39,801 INFO L93 Difference]: Finished difference Result 457 states and 691 transitions. [2023-12-19 15:20:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:20:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-12-19 15:20:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:39,804 INFO L225 Difference]: With dead ends: 457 [2023-12-19 15:20:39,804 INFO L226 Difference]: Without dead ends: 344 [2023-12-19 15:20:39,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:20:39,805 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 466 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:39,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1614 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:20:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-12-19 15:20:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 295. [2023-12-19 15:20:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 243 states have (on average 1.448559670781893) internal successors, (352), 244 states have internal predecessors, (352), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 446 transitions. [2023-12-19 15:20:39,849 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 446 transitions. Word has length 146 [2023-12-19 15:20:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:39,849 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 446 transitions. [2023-12-19 15:20:39,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 446 transitions. [2023-12-19 15:20:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:20:39,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:39,851 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:39,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:20:39,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:39,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1855736051, now seen corresponding path program 1 times [2023-12-19 15:20:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:39,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619230520] [2023-12-19 15:20:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619230520] [2023-12-19 15:20:39,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619230520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:39,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:39,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:39,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180923495] [2023-12-19 15:20:39,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:39,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:39,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:39,930 INFO L87 Difference]: Start difference. First operand 295 states and 446 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:39,955 INFO L93 Difference]: Finished difference Result 492 states and 744 transitions. [2023-12-19 15:20:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:20:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:39,957 INFO L225 Difference]: With dead ends: 492 [2023-12-19 15:20:39,957 INFO L226 Difference]: Without dead ends: 296 [2023-12-19 15:20:39,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 15:20:39,959 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:39,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-19 15:20:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2023-12-19 15:20:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 244 states have (on average 1.4426229508196722) internal successors, (352), 245 states have internal predecessors, (352), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 446 transitions. [2023-12-19 15:20:39,975 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 446 transitions. Word has length 147 [2023-12-19 15:20:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:39,975 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 446 transitions. [2023-12-19 15:20:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 446 transitions. [2023-12-19 15:20:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:20:39,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:39,977 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:39,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:20:39,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:39,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1989414503, now seen corresponding path program 1 times [2023-12-19 15:20:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:39,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908780242] [2023-12-19 15:20:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:40,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:40,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908780242] [2023-12-19 15:20:40,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908780242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:40,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:40,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:40,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231214051] [2023-12-19 15:20:40,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:40,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:40,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:40,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:40,056 INFO L87 Difference]: Start difference. First operand 296 states and 446 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:40,083 INFO L93 Difference]: Finished difference Result 545 states and 825 transitions. [2023-12-19 15:20:40,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:40,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:20:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:40,085 INFO L225 Difference]: With dead ends: 545 [2023-12-19 15:20:40,085 INFO L226 Difference]: Without dead ends: 348 [2023-12-19 15:20:40,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 15:20:40,086 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 45 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:40,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 339 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-12-19 15:20:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 300. [2023-12-19 15:20:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 248 states have (on average 1.435483870967742) internal successors, (356), 249 states have internal predecessors, (356), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 450 transitions. [2023-12-19 15:20:40,102 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 450 transitions. Word has length 147 [2023-12-19 15:20:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:40,102 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 450 transitions. [2023-12-19 15:20:40,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 450 transitions. [2023-12-19 15:20:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:20:40,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:40,104 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:40,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:20:40,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:40,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1025689115, now seen corresponding path program 1 times [2023-12-19 15:20:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112392207] [2023-12-19 15:20:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:40,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112392207] [2023-12-19 15:20:40,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112392207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:40,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:40,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413510160] [2023-12-19 15:20:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:40,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:40,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:40,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:40,214 INFO L87 Difference]: Start difference. First operand 300 states and 450 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:40,273 INFO L93 Difference]: Finished difference Result 673 states and 1015 transitions. [2023-12-19 15:20:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:20:40,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:20:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:40,275 INFO L225 Difference]: With dead ends: 673 [2023-12-19 15:20:40,275 INFO L226 Difference]: Without dead ends: 468 [2023-12-19 15:20:40,276 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-19 15:20:40,276 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 143 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:40,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 670 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-12-19 15:20:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 336. [2023-12-19 15:20:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 284 states have (on average 1.4471830985915493) internal successors, (411), 285 states have internal predecessors, (411), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 505 transitions. [2023-12-19 15:20:40,292 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 505 transitions. Word has length 147 [2023-12-19 15:20:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:40,293 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 505 transitions. [2023-12-19 15:20:40,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 505 transitions. [2023-12-19 15:20:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:20:40,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:40,294 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:40,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:20:40,294 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:40,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1929758155, now seen corresponding path program 1 times [2023-12-19 15:20:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659618810] [2023-12-19 15:20:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:40,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:40,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659618810] [2023-12-19 15:20:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659618810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:40,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:40,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293006665] [2023-12-19 15:20:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:40,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:40,437 INFO L87 Difference]: Start difference. First operand 336 states and 505 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:40,508 INFO L93 Difference]: Finished difference Result 642 states and 967 transitions. [2023-12-19 15:20:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:20:40,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:20:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:40,511 INFO L225 Difference]: With dead ends: 642 [2023-12-19 15:20:40,511 INFO L226 Difference]: Without dead ends: 405 [2023-12-19 15:20:40,511 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-19 15:20:40,512 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 141 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:40,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 727 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-12-19 15:20:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 336. [2023-12-19 15:20:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 284 states have (on average 1.4401408450704225) internal successors, (409), 285 states have internal predecessors, (409), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 503 transitions. [2023-12-19 15:20:40,535 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 503 transitions. Word has length 147 [2023-12-19 15:20:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:40,536 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 503 transitions. [2023-12-19 15:20:40,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 503 transitions. [2023-12-19 15:20:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:20:40,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:40,537 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:40,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:20:40,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:40,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 918640905, now seen corresponding path program 1 times [2023-12-19 15:20:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385462913] [2023-12-19 15:20:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:40,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385462913] [2023-12-19 15:20:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385462913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453786753] [2023-12-19 15:20:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:40,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:40,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:40,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:40,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:40,629 INFO L87 Difference]: Start difference. First operand 336 states and 503 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:40,653 INFO L93 Difference]: Finished difference Result 621 states and 935 transitions. [2023-12-19 15:20:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:40,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:20:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:40,655 INFO L225 Difference]: With dead ends: 621 [2023-12-19 15:20:40,655 INFO L226 Difference]: Without dead ends: 384 [2023-12-19 15:20:40,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 15:20:40,657 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 43 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:40,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 331 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-12-19 15:20:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 336. [2023-12-19 15:20:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 284 states have (on average 1.4330985915492958) internal successors, (407), 285 states have internal predecessors, (407), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 501 transitions. [2023-12-19 15:20:40,676 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 501 transitions. Word has length 147 [2023-12-19 15:20:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:40,676 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 501 transitions. [2023-12-19 15:20:40,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 501 transitions. [2023-12-19 15:20:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:20:40,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:40,678 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:40,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:20:40,678 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:40,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash 516216025, now seen corresponding path program 1 times [2023-12-19 15:20:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:40,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20595852] [2023-12-19 15:20:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:40,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20595852] [2023-12-19 15:20:40,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20595852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:40,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:40,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797035575] [2023-12-19 15:20:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:40,751 INFO L87 Difference]: Start difference. First operand 336 states and 501 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:40,774 INFO L93 Difference]: Finished difference Result 546 states and 815 transitions. [2023-12-19 15:20:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-19 15:20:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:40,776 INFO L225 Difference]: With dead ends: 546 [2023-12-19 15:20:40,776 INFO L226 Difference]: Without dead ends: 309 [2023-12-19 15:20:40,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 15:20:40,777 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:40,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-19 15:20:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2023-12-19 15:20:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 257 states have (on average 1.416342412451362) internal successors, (364), 258 states have internal predecessors, (364), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 458 transitions. [2023-12-19 15:20:40,790 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 458 transitions. Word has length 147 [2023-12-19 15:20:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:40,790 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 458 transitions. [2023-12-19 15:20:40,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 458 transitions. [2023-12-19 15:20:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:40,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:40,791 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:40,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:20:40,791 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:40,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1266806115, now seen corresponding path program 1 times [2023-12-19 15:20:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050981004] [2023-12-19 15:20:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:41,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:41,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050981004] [2023-12-19 15:20:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050981004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:41,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:20:41,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144364723] [2023-12-19 15:20:41,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:41,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:20:41,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:41,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:20:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:20:41,959 INFO L87 Difference]: Start difference. First operand 309 states and 458 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:42,804 INFO L93 Difference]: Finished difference Result 867 states and 1292 transitions. [2023-12-19 15:20:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:20:42,804 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:20:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:42,807 INFO L225 Difference]: With dead ends: 867 [2023-12-19 15:20:42,807 INFO L226 Difference]: Without dead ends: 655 [2023-12-19 15:20:42,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2023-12-19 15:20:42,808 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 695 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:42,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1062 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:20:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-19 15:20:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 307. [2023-12-19 15:20:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 255 states have (on average 1.411764705882353) internal successors, (360), 256 states have internal predecessors, (360), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 454 transitions. [2023-12-19 15:20:42,823 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 454 transitions. Word has length 148 [2023-12-19 15:20:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:42,823 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 454 transitions. [2023-12-19 15:20:42,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 454 transitions. [2023-12-19 15:20:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:42,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:42,825 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:42,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:20:42,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:42,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -587496944, now seen corresponding path program 1 times [2023-12-19 15:20:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132516867] [2023-12-19 15:20:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:42,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132516867] [2023-12-19 15:20:42,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132516867] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:42,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:42,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:42,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686529009] [2023-12-19 15:20:42,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:42,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:42,981 INFO L87 Difference]: Start difference. First operand 307 states and 454 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:43,017 INFO L93 Difference]: Finished difference Result 549 states and 815 transitions. [2023-12-19 15:20:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:20:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:20:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:43,019 INFO L225 Difference]: With dead ends: 549 [2023-12-19 15:20:43,019 INFO L226 Difference]: Without dead ends: 339 [2023-12-19 15:20:43,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-19 15:20:43,020 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 58 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 667 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-19 15:20:43,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 667 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-12-19 15:20:43,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 313. [2023-12-19 15:20:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 261 states have (on average 1.4022988505747127) internal successors, (366), 262 states have internal predecessors, (366), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 460 transitions. [2023-12-19 15:20:43,032 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 460 transitions. Word has length 148 [2023-12-19 15:20:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:43,033 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 460 transitions. [2023-12-19 15:20:43,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 460 transitions. [2023-12-19 15:20:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:43,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:43,035 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:43,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:20:43,035 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:43,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2017043931, now seen corresponding path program 1 times [2023-12-19 15:20:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:43,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79462731] [2023-12-19 15:20:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79462731] [2023-12-19 15:20:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79462731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:44,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:44,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 15:20:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841703036] [2023-12-19 15:20:44,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:44,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 15:20:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 15:20:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:20:44,418 INFO L87 Difference]: Start difference. First operand 313 states and 460 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:20:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:45,467 INFO L93 Difference]: Finished difference Result 644 states and 946 transitions. [2023-12-19 15:20:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:20:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-12-19 15:20:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:45,470 INFO L225 Difference]: With dead ends: 644 [2023-12-19 15:20:45,470 INFO L226 Difference]: Without dead ends: 428 [2023-12-19 15:20:45,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-12-19 15:20:45,471 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 759 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:45,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 914 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:20:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-19 15:20:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 334. [2023-12-19 15:20:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 282 states have (on average 1.4148936170212767) internal successors, (399), 283 states have internal predecessors, (399), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 493 transitions. [2023-12-19 15:20:45,494 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 493 transitions. Word has length 148 [2023-12-19 15:20:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:45,494 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 493 transitions. [2023-12-19 15:20:45,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:20:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 493 transitions. [2023-12-19 15:20:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:45,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:45,496 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:45,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:20:45,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:45,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1142288591, now seen corresponding path program 1 times [2023-12-19 15:20:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50471105] [2023-12-19 15:20:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:45,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50471105] [2023-12-19 15:20:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50471105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:45,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:45,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:45,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276250404] [2023-12-19 15:20:45,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:45,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:45,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:45,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:45,709 INFO L87 Difference]: Start difference. First operand 334 states and 493 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:45,821 INFO L93 Difference]: Finished difference Result 596 states and 881 transitions. [2023-12-19 15:20:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:20:45,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:20:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:45,823 INFO L225 Difference]: With dead ends: 596 [2023-12-19 15:20:45,823 INFO L226 Difference]: Without dead ends: 339 [2023-12-19 15:20:45,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 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-19 15:20:45,824 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 18 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:45,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 567 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:20:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-12-19 15:20:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2023-12-19 15:20:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 283 states have (on average 1.4098939929328622) internal successors, (399), 284 states have internal predecessors, (399), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 493 transitions. [2023-12-19 15:20:45,846 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 493 transitions. Word has length 148 [2023-12-19 15:20:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:45,846 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 493 transitions. [2023-12-19 15:20:45,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 493 transitions. [2023-12-19 15:20:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:45,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:45,847 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:45,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:20:45,848 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:45,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1282837201, now seen corresponding path program 1 times [2023-12-19 15:20:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181698295] [2023-12-19 15:20:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181698295] [2023-12-19 15:20:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181698295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:20:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919993972] [2023-12-19 15:20:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:46,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:20:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:46,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:20:46,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:20:46,776 INFO L87 Difference]: Start difference. First operand 335 states and 493 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:20:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:47,734 INFO L93 Difference]: Finished difference Result 738 states and 1087 transitions. [2023-12-19 15:20:47,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:20:47,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-12-19 15:20:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:47,737 INFO L225 Difference]: With dead ends: 738 [2023-12-19 15:20:47,737 INFO L226 Difference]: Without dead ends: 500 [2023-12-19 15:20:47,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:20:47,738 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 427 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:47,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1218 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:20:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-12-19 15:20:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 357. [2023-12-19 15:20:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 305 states have (on average 1.419672131147541) internal successors, (433), 306 states have internal predecessors, (433), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 527 transitions. [2023-12-19 15:20:47,766 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 527 transitions. Word has length 148 [2023-12-19 15:20:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:47,767 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 527 transitions. [2023-12-19 15:20:47,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:20:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 527 transitions. [2023-12-19 15:20:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:47,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:47,768 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:47,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:20:47,768 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:47,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1104933147, now seen corresponding path program 1 times [2023-12-19 15:20:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920451479] [2023-12-19 15:20:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:48,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:48,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920451479] [2023-12-19 15:20:48,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920451479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:48,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:48,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:20:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550540165] [2023-12-19 15:20:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:48,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:20:48,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:48,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:20:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:20:48,866 INFO L87 Difference]: Start difference. First operand 357 states and 527 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:20:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:49,895 INFO L93 Difference]: Finished difference Result 712 states and 1048 transitions. [2023-12-19 15:20:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:20:49,895 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-12-19 15:20:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:49,897 INFO L225 Difference]: With dead ends: 712 [2023-12-19 15:20:49,897 INFO L226 Difference]: Without dead ends: 452 [2023-12-19 15:20:49,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2023-12-19 15:20:49,898 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 395 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:49,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1025 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:20:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-12-19 15:20:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 357. [2023-12-19 15:20:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 305 states have (on average 1.419672131147541) internal successors, (433), 306 states have internal predecessors, (433), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-19 15:20:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 527 transitions. [2023-12-19 15:20:49,931 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 527 transitions. Word has length 148 [2023-12-19 15:20:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:49,931 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 527 transitions. [2023-12-19 15:20:49,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:20:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 527 transitions. [2023-12-19 15:20:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:49,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:49,932 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:49,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:20:49,932 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:49,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash 93815897, now seen corresponding path program 1 times [2023-12-19 15:20:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477853804] [2023-12-19 15:20:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477853804] [2023-12-19 15:20:50,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477853804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:50,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:50,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:20:50,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145940881] [2023-12-19 15:20:50,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:50,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:20:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:20:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:20:50,347 INFO L87 Difference]: Start difference. First operand 357 states and 527 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:50,846 INFO L93 Difference]: Finished difference Result 983 states and 1435 transitions. [2023-12-19 15:20:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 15:20:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:20:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:50,849 INFO L225 Difference]: With dead ends: 983 [2023-12-19 15:20:50,849 INFO L226 Difference]: Without dead ends: 723 [2023-12-19 15:20:50,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:20:50,850 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 802 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:50,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 973 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:20:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2023-12-19 15:20:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 487. [2023-12-19 15:20:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 412 states have (on average 1.3980582524271845) internal successors, (576), 415 states have internal predecessors, (576), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2023-12-19 15:20:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 710 transitions. [2023-12-19 15:20:50,900 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 710 transitions. Word has length 148 [2023-12-19 15:20:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:50,900 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 710 transitions. [2023-12-19 15:20:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 710 transitions. [2023-12-19 15:20:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:50,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:50,901 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:20:50,901 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:50,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash 351981335, now seen corresponding path program 1 times [2023-12-19 15:20:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:50,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806630691] [2023-12-19 15:20:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:51,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:51,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806630691] [2023-12-19 15:20:51,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806630691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:51,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:20:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584656212] [2023-12-19 15:20:51,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:51,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:20:51,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:51,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:20:51,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:20:51,439 INFO L87 Difference]: Start difference. First operand 487 states and 710 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:51,807 INFO L93 Difference]: Finished difference Result 901 states and 1315 transitions. [2023-12-19 15:20:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:20:51,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:20:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:51,809 INFO L225 Difference]: With dead ends: 901 [2023-12-19 15:20:51,809 INFO L226 Difference]: Without dead ends: 515 [2023-12-19 15:20:51,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:20:51,810 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 423 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:51,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 563 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:20:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2023-12-19 15:20:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 479. [2023-12-19 15:20:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 404 states have (on average 1.3935643564356435) internal successors, (563), 407 states have internal predecessors, (563), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2023-12-19 15:20:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 697 transitions. [2023-12-19 15:20:51,849 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 697 transitions. Word has length 148 [2023-12-19 15:20:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:51,849 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 697 transitions. [2023-12-19 15:20:51,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:20:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 697 transitions. [2023-12-19 15:20:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:51,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:51,850 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:51,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 15:20:51,850 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:51,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1039104881, now seen corresponding path program 1 times [2023-12-19 15:20:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024739530] [2023-12-19 15:20:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:52,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024739530] [2023-12-19 15:20:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024739530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:52,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:52,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 15:20:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287019772] [2023-12-19 15:20:52,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:52,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 15:20:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 15:20:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:20:52,905 INFO L87 Difference]: Start difference. First operand 479 states and 697 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:20:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:54,054 INFO L93 Difference]: Finished difference Result 892 states and 1297 transitions. [2023-12-19 15:20:54,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 15:20:54,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-12-19 15:20:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:54,056 INFO L225 Difference]: With dead ends: 892 [2023-12-19 15:20:54,056 INFO L226 Difference]: Without dead ends: 514 [2023-12-19 15:20:54,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2023-12-19 15:20:54,057 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 496 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:54,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1570 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:20:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-12-19 15:20:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 429. [2023-12-19 15:20:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 363 states have (on average 1.3911845730027548) internal successors, (505), 365 states have internal predecessors, (505), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-19 15:20:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 621 transitions. [2023-12-19 15:20:54,094 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 621 transitions. Word has length 148 [2023-12-19 15:20:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:54,094 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 621 transitions. [2023-12-19 15:20:54,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:20:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 621 transitions. [2023-12-19 15:20:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:54,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:54,095 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:54,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 15:20:54,095 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:54,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1560999655, now seen corresponding path program 1 times [2023-12-19 15:20:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493771635] [2023-12-19 15:20:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:55,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493771635] [2023-12-19 15:20:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493771635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:55,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-19 15:20:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768846273] [2023-12-19 15:20:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:55,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-19 15:20:55,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:55,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-19 15:20:55,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2023-12-19 15:20:55,929 INFO L87 Difference]: Start difference. First operand 429 states and 621 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) [2023-12-19 15:20:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:58,135 INFO L93 Difference]: Finished difference Result 903 states and 1311 transitions. [2023-12-19 15:20:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-19 15:20:58,136 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) Word has length 148 [2023-12-19 15:20:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:58,145 INFO L225 Difference]: With dead ends: 903 [2023-12-19 15:20:58,145 INFO L226 Difference]: Without dead ends: 575 [2023-12-19 15:20:58,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2023-12-19 15:20:58,147 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 935 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:58,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 2101 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-19 15:20:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2023-12-19 15:20:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 518. [2023-12-19 15:20:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 440 states have (on average 1.393181818181818) internal successors, (613), 443 states have internal predecessors, (613), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-19 15:20:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 751 transitions. [2023-12-19 15:20:58,196 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 751 transitions. Word has length 148 [2023-12-19 15:20:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:58,197 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 751 transitions. [2023-12-19 15:20:58,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) [2023-12-19 15:20:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 751 transitions. [2023-12-19 15:20:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:58,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:58,198 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:58,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 15:20:58,198 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:58,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2032903063, now seen corresponding path program 1 times [2023-12-19 15:20:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75540205] [2023-12-19 15:20:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:20:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:20:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:20:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:20:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:20:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:20:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:20:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:20:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:20:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:20:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:20:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:20:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:20:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:20:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:20:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:20:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:20:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:20:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:20:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:59,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75540205] [2023-12-19 15:20:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75540205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:59,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:59,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:20:59,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962493629] [2023-12-19 15:20:59,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:59,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:20:59,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:59,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:20:59,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:20:59,146 INFO L87 Difference]: Start difference. First operand 518 states and 751 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:20:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:59,803 INFO L93 Difference]: Finished difference Result 1020 states and 1482 transitions. [2023-12-19 15:20:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:20:59,803 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-12-19 15:20:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:59,805 INFO L225 Difference]: With dead ends: 1020 [2023-12-19 15:20:59,805 INFO L226 Difference]: Without dead ends: 603 [2023-12-19 15:20:59,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-12-19 15:20:59,806 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 615 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:59,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 850 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 15:20:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2023-12-19 15:20:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 537. [2023-12-19 15:20:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 459 states have (on average 1.3965141612200436) internal successors, (641), 462 states have internal predecessors, (641), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-19 15:20:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 779 transitions. [2023-12-19 15:20:59,861 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 779 transitions. Word has length 148 [2023-12-19 15:20:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:59,861 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 779 transitions. [2023-12-19 15:20:59,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:20:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 779 transitions. [2023-12-19 15:20:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:59,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:59,862 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:59,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 15:20:59,862 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:59,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 974193641, now seen corresponding path program 1 times [2023-12-19 15:20:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:59,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306943592] [2023-12-19 15:20:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:00,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306943592] [2023-12-19 15:21:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306943592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:00,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:21:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981981210] [2023-12-19 15:21:00,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:00,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:21:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:21:00,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:21:00,183 INFO L87 Difference]: Start difference. First operand 537 states and 779 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:00,559 INFO L93 Difference]: Finished difference Result 1169 states and 1698 transitions. [2023-12-19 15:21:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:21:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:21:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:00,563 INFO L225 Difference]: With dead ends: 1169 [2023-12-19 15:21:00,563 INFO L226 Difference]: Without dead ends: 733 [2023-12-19 15:21:00,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:21:00,564 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 470 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:00,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 712 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:21:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2023-12-19 15:21:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 613. [2023-12-19 15:21:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 525 states have (on average 1.3961904761904762) internal successors, (733), 529 states have internal predecessors, (733), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-19 15:21:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 889 transitions. [2023-12-19 15:21:00,618 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 889 transitions. Word has length 148 [2023-12-19 15:21:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:00,618 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 889 transitions. [2023-12-19 15:21:00,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 889 transitions. [2023-12-19 15:21:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:21:00,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:00,619 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:00,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 15:21:00,619 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:00,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1701548265, now seen corresponding path program 1 times [2023-12-19 15:21:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:00,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631104979] [2023-12-19 15:21:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631104979] [2023-12-19 15:21:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631104979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:01,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:01,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:21:01,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588077953] [2023-12-19 15:21:01,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:01,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:21:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:21:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:21:01,504 INFO L87 Difference]: Start difference. First operand 613 states and 889 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:21:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:02,106 INFO L93 Difference]: Finished difference Result 1192 states and 1727 transitions. [2023-12-19 15:21:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:21:02,108 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-12-19 15:21:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:02,110 INFO L225 Difference]: With dead ends: 1192 [2023-12-19 15:21:02,110 INFO L226 Difference]: Without dead ends: 680 [2023-12-19 15:21:02,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:21:02,111 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 573 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:02,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 816 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:21:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-12-19 15:21:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 562. [2023-12-19 15:21:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 483 states have (on average 1.3933747412008282) internal successors, (673), 486 states have internal predecessors, (673), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-19 15:21:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 811 transitions. [2023-12-19 15:21:02,168 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 811 transitions. Word has length 148 [2023-12-19 15:21:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:02,169 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 811 transitions. [2023-12-19 15:21:02,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:21:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 811 transitions. [2023-12-19 15:21:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:21:02,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:02,170 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:02,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 15:21:02,170 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:02,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1892354453, now seen corresponding path program 1 times [2023-12-19 15:21:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094714026] [2023-12-19 15:21:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:02,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:03,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094714026] [2023-12-19 15:21:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094714026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 15:21:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048853641] [2023-12-19 15:21:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:03,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 15:21:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:03,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 15:21:03,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:21:03,009 INFO L87 Difference]: Start difference. First operand 562 states and 811 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:04,295 INFO L93 Difference]: Finished difference Result 1088 states and 1568 transitions. [2023-12-19 15:21:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:21:04,296 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:21:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:04,297 INFO L225 Difference]: With dead ends: 1088 [2023-12-19 15:21:04,297 INFO L226 Difference]: Without dead ends: 627 [2023-12-19 15:21:04,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2023-12-19 15:21:04,299 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 380 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:04,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1976 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 15:21:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-12-19 15:21:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 560. [2023-12-19 15:21:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 481 states have (on average 1.392931392931393) internal successors, (670), 484 states have internal predecessors, (670), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-19 15:21:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 808 transitions. [2023-12-19 15:21:04,361 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 808 transitions. Word has length 148 [2023-12-19 15:21:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:04,361 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 808 transitions. [2023-12-19 15:21:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 808 transitions. [2023-12-19 15:21:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:21:04,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:04,362 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:04,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 15:21:04,362 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:04,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash -810739607, now seen corresponding path program 1 times [2023-12-19 15:21:04,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:04,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384508720] [2023-12-19 15:21:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:04,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384508720] [2023-12-19 15:21:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384508720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:21:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296729774] [2023-12-19 15:21:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:04,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:21:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:21:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:21:04,676 INFO L87 Difference]: Start difference. First operand 560 states and 808 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:05,021 INFO L93 Difference]: Finished difference Result 1026 states and 1478 transitions. [2023-12-19 15:21:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:21:05,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:21:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:05,023 INFO L225 Difference]: With dead ends: 1026 [2023-12-19 15:21:05,023 INFO L226 Difference]: Without dead ends: 567 [2023-12-19 15:21:05,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:21:05,024 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 367 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:05,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 594 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:21:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2023-12-19 15:21:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 443. [2023-12-19 15:21:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 386 states have (on average 1.3989637305699483) internal successors, (540), 387 states have internal predecessors, (540), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 638 transitions. [2023-12-19 15:21:05,070 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 638 transitions. Word has length 148 [2023-12-19 15:21:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:05,070 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 638 transitions. [2023-12-19 15:21:05,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 638 transitions. [2023-12-19 15:21:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:21:05,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:05,071 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:05,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-19 15:21:05,071 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:05,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1397545621, now seen corresponding path program 1 times [2023-12-19 15:21:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44334139] [2023-12-19 15:21:05,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:05,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:06,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:06,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44334139] [2023-12-19 15:21:06,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44334139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:06,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:06,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-19 15:21:06,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632089524] [2023-12-19 15:21:06,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:06,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-19 15:21:06,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:06,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-19 15:21:06,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:21:06,046 INFO L87 Difference]: Start difference. First operand 443 states and 638 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:21:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:07,120 INFO L93 Difference]: Finished difference Result 845 states and 1217 transitions. [2023-12-19 15:21:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 15:21:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-12-19 15:21:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:07,121 INFO L225 Difference]: With dead ends: 845 [2023-12-19 15:21:07,121 INFO L226 Difference]: Without dead ends: 503 [2023-12-19 15:21:07,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2023-12-19 15:21:07,122 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 509 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:07,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1842 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:21:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-12-19 15:21:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 441. [2023-12-19 15:21:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 384 states have (on average 1.4010416666666667) internal successors, (538), 385 states have internal predecessors, (538), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 636 transitions. [2023-12-19 15:21:07,168 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 636 transitions. Word has length 148 [2023-12-19 15:21:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:07,168 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 636 transitions. [2023-12-19 15:21:07,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:21:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 636 transitions. [2023-12-19 15:21:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:21:07,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:07,169 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:07,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 15:21:07,169 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:07,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -555932433, now seen corresponding path program 1 times [2023-12-19 15:21:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138567522] [2023-12-19 15:21:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:07,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:07,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138567522] [2023-12-19 15:21:07,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138567522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:07,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:07,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 15:21:07,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523088906] [2023-12-19 15:21:07,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:07,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 15:21:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 15:21:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:21:07,838 INFO L87 Difference]: Start difference. First operand 441 states and 636 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:08,797 INFO L93 Difference]: Finished difference Result 840 states and 1212 transitions. [2023-12-19 15:21:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:21:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-19 15:21:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:08,799 INFO L225 Difference]: With dead ends: 840 [2023-12-19 15:21:08,799 INFO L226 Difference]: Without dead ends: 500 [2023-12-19 15:21:08,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2023-12-19 15:21:08,800 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 416 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:08,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1692 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:21:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-12-19 15:21:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 438. [2023-12-19 15:21:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 381 states have (on average 1.4041994750656168) internal successors, (535), 382 states have internal predecessors, (535), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 633 transitions. [2023-12-19 15:21:08,848 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 633 transitions. Word has length 148 [2023-12-19 15:21:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:08,848 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 633 transitions. [2023-12-19 15:21:08,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 633 transitions. [2023-12-19 15:21:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:21:08,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:08,849 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:08,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 15:21:08,849 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:08,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash -253366923, now seen corresponding path program 1 times [2023-12-19 15:21:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:08,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965430752] [2023-12-19 15:21:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965430752] [2023-12-19 15:21:09,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965430752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:09,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:09,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:21:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159282942] [2023-12-19 15:21:09,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:09,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:21:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:21:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:21:09,146 INFO L87 Difference]: Start difference. First operand 438 states and 633 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:09,550 INFO L93 Difference]: Finished difference Result 1173 states and 1710 transitions. [2023-12-19 15:21:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 15:21:09,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-12-19 15:21:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:09,552 INFO L225 Difference]: With dead ends: 1173 [2023-12-19 15:21:09,552 INFO L226 Difference]: Without dead ends: 836 [2023-12-19 15:21:09,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2023-12-19 15:21:09,553 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 491 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:09,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 919 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2023-12-19 15:21:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 634. [2023-12-19 15:21:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 577 states have (on average 1.4436741767764298) internal successors, (833), 578 states have internal predecessors, (833), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 931 transitions. [2023-12-19 15:21:09,604 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 931 transitions. Word has length 150 [2023-12-19 15:21:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:09,604 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 931 transitions. [2023-12-19 15:21:09,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 931 transitions. [2023-12-19 15:21:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:21:09,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:09,605 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:09,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-19 15:21:09,605 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:09,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash -112818313, now seen corresponding path program 1 times [2023-12-19 15:21:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629897484] [2023-12-19 15:21:09,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629897484] [2023-12-19 15:21:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629897484] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-19 15:21:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895462706] [2023-12-19 15:21:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:10,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-19 15:21:10,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-19 15:21:10,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:21:10,644 INFO L87 Difference]: Start difference. First operand 634 states and 931 transitions. Second operand has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:21:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:12,297 INFO L93 Difference]: Finished difference Result 1651 states and 2413 transitions. [2023-12-19 15:21:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 15:21:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2023-12-19 15:21:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:12,301 INFO L225 Difference]: With dead ends: 1651 [2023-12-19 15:21:12,301 INFO L226 Difference]: Without dead ends: 1150 [2023-12-19 15:21:12,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2023-12-19 15:21:12,302 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 795 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:12,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2298 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-19 15:21:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2023-12-19 15:21:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 651. [2023-12-19 15:21:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 594 states have (on average 1.4393939393939394) internal successors, (855), 595 states have internal predecessors, (855), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 953 transitions. [2023-12-19 15:21:12,358 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 953 transitions. Word has length 150 [2023-12-19 15:21:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:12,359 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 953 transitions. [2023-12-19 15:21:12,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:21:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 953 transitions. [2023-12-19 15:21:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:21:12,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:12,360 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:12,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 15:21:12,360 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:12,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -772827433, now seen corresponding path program 1 times [2023-12-19 15:21:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920592872] [2023-12-19 15:21:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:12,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920592872] [2023-12-19 15:21:12,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920592872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:12,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:12,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:21:12,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575996979] [2023-12-19 15:21:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:12,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:21:12,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:12,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:21:12,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:21:12,530 INFO L87 Difference]: Start difference. First operand 651 states and 953 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:12,768 INFO L93 Difference]: Finished difference Result 1483 states and 2150 transitions. [2023-12-19 15:21:12,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:21:12,769 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-12-19 15:21:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:12,771 INFO L225 Difference]: With dead ends: 1483 [2023-12-19 15:21:12,771 INFO L226 Difference]: Without dead ends: 982 [2023-12-19 15:21:12,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 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-19 15:21:12,772 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 255 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:12,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 727 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:21:12,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2023-12-19 15:21:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 653. [2023-12-19 15:21:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 596 states have (on average 1.4379194630872483) internal successors, (857), 597 states have internal predecessors, (857), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 955 transitions. [2023-12-19 15:21:12,826 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 955 transitions. Word has length 150 [2023-12-19 15:21:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:12,826 INFO L495 AbstractCegarLoop]: Abstraction has 653 states and 955 transitions. [2023-12-19 15:21:12,826 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 955 transitions. [2023-12-19 15:21:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:21:12,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:12,827 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:12,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-19 15:21:12,827 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:12,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -514661995, now seen corresponding path program 1 times [2023-12-19 15:21:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:12,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32258278] [2023-12-19 15:21:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32258278] [2023-12-19 15:21:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32258278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-19 15:21:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551522258] [2023-12-19 15:21:13,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:13,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-19 15:21:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-19 15:21:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-12-19 15:21:13,978 INFO L87 Difference]: Start difference. First operand 653 states and 955 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:15,938 INFO L93 Difference]: Finished difference Result 1497 states and 2175 transitions. [2023-12-19 15:21:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-19 15:21:15,939 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2023-12-19 15:21:15,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:15,941 INFO L225 Difference]: With dead ends: 1497 [2023-12-19 15:21:15,941 INFO L226 Difference]: Without dead ends: 994 [2023-12-19 15:21:15,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2023-12-19 15:21:15,943 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 919 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:15,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2584 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 15:21:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2023-12-19 15:21:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 695. [2023-12-19 15:21:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 638 states have (on average 1.4420062695924765) internal successors, (920), 639 states have internal predecessors, (920), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1018 transitions. [2023-12-19 15:21:15,999 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1018 transitions. Word has length 150 [2023-12-19 15:21:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:15,999 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1018 transitions. [2023-12-19 15:21:15,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1018 transitions. [2023-12-19 15:21:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:21:16,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:16,000 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:16,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 15:21:16,000 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:16,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash -477953353, now seen corresponding path program 1 times [2023-12-19 15:21:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90231415] [2023-12-19 15:21:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:17,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90231415] [2023-12-19 15:21:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90231415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-19 15:21:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188673095] [2023-12-19 15:21:17,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:17,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-19 15:21:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:17,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-19 15:21:17,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:21:17,262 INFO L87 Difference]: Start difference. First operand 695 states and 1018 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:21:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:19,480 INFO L93 Difference]: Finished difference Result 1803 states and 2630 transitions. [2023-12-19 15:21:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-19 15:21:19,480 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2023-12-19 15:21:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:19,483 INFO L225 Difference]: With dead ends: 1803 [2023-12-19 15:21:19,483 INFO L226 Difference]: Without dead ends: 1258 [2023-12-19 15:21:19,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2023-12-19 15:21:19,494 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 887 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:19,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 3156 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-19 15:21:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2023-12-19 15:21:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 715. [2023-12-19 15:21:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 658 states have (on average 1.4452887537993921) internal successors, (951), 659 states have internal predecessors, (951), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1049 transitions. [2023-12-19 15:21:19,555 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1049 transitions. Word has length 150 [2023-12-19 15:21:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:19,555 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 1049 transitions. [2023-12-19 15:21:19,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-19 15:21:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1049 transitions. [2023-12-19 15:21:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:21:19,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:19,556 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:19,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-19 15:21:19,556 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:19,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1223825685, now seen corresponding path program 1 times [2023-12-19 15:21:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:19,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624378842] [2023-12-19 15:21:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624378842] [2023-12-19 15:21:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624378842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:20,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:20,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-19 15:21:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378389150] [2023-12-19 15:21:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:20,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-19 15:21:20,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-19 15:21:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-12-19 15:21:20,764 INFO L87 Difference]: Start difference. First operand 715 states and 1049 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:23,128 INFO L93 Difference]: Finished difference Result 1399 states and 2044 transitions. [2023-12-19 15:21:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 15:21:23,129 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2023-12-19 15:21:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:23,131 INFO L225 Difference]: With dead ends: 1399 [2023-12-19 15:21:23,131 INFO L226 Difference]: Without dead ends: 854 [2023-12-19 15:21:23,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2023-12-19 15:21:23,133 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 713 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:23,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2597 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-19 15:21:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2023-12-19 15:21:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 716. [2023-12-19 15:21:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 659 states have (on average 1.4461305007587253) internal successors, (953), 660 states have internal predecessors, (953), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1051 transitions. [2023-12-19 15:21:23,195 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1051 transitions. Word has length 150 [2023-12-19 15:21:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:23,195 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 1051 transitions. [2023-12-19 15:21:23,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1051 transitions. [2023-12-19 15:21:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:21:23,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:23,197 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:23,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-19 15:21:23,197 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:23,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1481991123, now seen corresponding path program 1 times [2023-12-19 15:21:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071076445] [2023-12-19 15:21:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071076445] [2023-12-19 15:21:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071076445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:23,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:23,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:21:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670872719] [2023-12-19 15:21:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:23,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:21:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:21:23,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:21:23,626 INFO L87 Difference]: Start difference. First operand 716 states and 1051 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:24,198 INFO L93 Difference]: Finished difference Result 1507 states and 2191 transitions. [2023-12-19 15:21:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:21:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-12-19 15:21:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:24,201 INFO L225 Difference]: With dead ends: 1507 [2023-12-19 15:21:24,201 INFO L226 Difference]: Without dead ends: 961 [2023-12-19 15:21:24,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:21:24,202 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 423 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:24,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1082 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:21:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2023-12-19 15:21:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 718. [2023-12-19 15:21:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 661 states have (on average 1.4417549167927384) internal successors, (953), 662 states have internal predecessors, (953), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1051 transitions. [2023-12-19 15:21:24,301 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1051 transitions. Word has length 150 [2023-12-19 15:21:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:24,301 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 1051 transitions. [2023-12-19 15:21:24,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1051 transitions. [2023-12-19 15:21:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:21:24,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:24,302 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:24,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-19 15:21:24,303 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:24,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1147913577, now seen corresponding path program 1 times [2023-12-19 15:21:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328198677] [2023-12-19 15:21:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:24,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:24,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328198677] [2023-12-19 15:21:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328198677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:24,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:21:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82741743] [2023-12-19 15:21:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:24,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:21:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:21:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:21:24,467 INFO L87 Difference]: Start difference. First operand 718 states and 1051 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:24,635 INFO L93 Difference]: Finished difference Result 1226 states and 1797 transitions. [2023-12-19 15:21:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:21:24,635 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-12-19 15:21:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:24,637 INFO L225 Difference]: With dead ends: 1226 [2023-12-19 15:21:24,637 INFO L226 Difference]: Without dead ends: 678 [2023-12-19 15:21:24,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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-19 15:21:24,638 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 57 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:24,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 545 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:21:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2023-12-19 15:21:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2023-12-19 15:21:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 621 states have (on average 1.4380032206119162) internal successors, (893), 622 states have internal predecessors, (893), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 991 transitions. [2023-12-19 15:21:24,697 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 991 transitions. Word has length 150 [2023-12-19 15:21:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:24,697 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 991 transitions. [2023-12-19 15:21:24,697 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 991 transitions. [2023-12-19 15:21:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 15:21:24,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:24,698 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:24,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-19 15:21:24,699 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:24,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1016824427, now seen corresponding path program 1 times [2023-12-19 15:21:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418051754] [2023-12-19 15:21:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:24,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418051754] [2023-12-19 15:21:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418051754] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:24,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:24,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:21:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422526811] [2023-12-19 15:21:24,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:24,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:21:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:24,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:21:24,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:21:24,750 INFO L87 Difference]: Start difference. First operand 678 states and 991 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:24,819 INFO L93 Difference]: Finished difference Result 1245 states and 1819 transitions. [2023-12-19 15:21:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:21:24,819 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-12-19 15:21:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:24,821 INFO L225 Difference]: With dead ends: 1245 [2023-12-19 15:21:24,821 INFO L226 Difference]: Without dead ends: 732 [2023-12-19 15:21:24,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 15:21:24,822 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 28 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:24,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 348 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:21:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2023-12-19 15:21:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 682. [2023-12-19 15:21:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 625 states have (on average 1.4352) internal successors, (897), 626 states have internal predecessors, (897), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 995 transitions. [2023-12-19 15:21:24,884 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 995 transitions. Word has length 151 [2023-12-19 15:21:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:24,885 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 995 transitions. [2023-12-19 15:21:24,885 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 995 transitions. [2023-12-19 15:21:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 15:21:24,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:24,886 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:24,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-19 15:21:24,886 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:24,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1717889005, now seen corresponding path program 1 times [2023-12-19 15:21:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547076593] [2023-12-19 15:21:24,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547076593] [2023-12-19 15:21:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547076593] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:24,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:24,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:21:24,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002921041] [2023-12-19 15:21:24,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:24,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:21:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:21:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:21:24,994 INFO L87 Difference]: Start difference. First operand 682 states and 995 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:25,095 INFO L93 Difference]: Finished difference Result 1277 states and 1861 transitions. [2023-12-19 15:21:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:21:25,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-12-19 15:21:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:25,098 INFO L225 Difference]: With dead ends: 1277 [2023-12-19 15:21:25,098 INFO L226 Difference]: Without dead ends: 766 [2023-12-19 15:21:25,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 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-19 15:21:25,099 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 82 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:25,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 828 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:21:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-12-19 15:21:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 686. [2023-12-19 15:21:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 629 states have (on average 1.4324324324324325) internal successors, (901), 630 states have internal predecessors, (901), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-19 15:21:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 999 transitions. [2023-12-19 15:21:25,159 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 999 transitions. Word has length 151 [2023-12-19 15:21:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:25,160 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 999 transitions. [2023-12-19 15:21:25,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 999 transitions. [2023-12-19 15:21:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 15:21:25,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:25,161 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:25,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-19 15:21:25,161 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:25,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1380624069, now seen corresponding path program 1 times [2023-12-19 15:21:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:25,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034246840] [2023-12-19 15:21:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:25,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034246840] [2023-12-19 15:21:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034246840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:21:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406996816] [2023-12-19 15:21:25,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:25,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:21:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:25,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:21:25,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:21:25,745 INFO L87 Difference]: Start difference. First operand 686 states and 999 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:26,610 INFO L93 Difference]: Finished difference Result 1367 states and 1978 transitions. [2023-12-19 15:21:26,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:21:26,610 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2023-12-19 15:21:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:26,612 INFO L225 Difference]: With dead ends: 1367 [2023-12-19 15:21:26,612 INFO L226 Difference]: Without dead ends: 853 [2023-12-19 15:21:26,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2023-12-19 15:21:26,613 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 365 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:26,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1878 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:21:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2023-12-19 15:21:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 576. [2023-12-19 15:21:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 531 states have (on average 1.448210922787194) internal successors, (769), 531 states have internal predecessors, (769), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 15:21:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 845 transitions. [2023-12-19 15:21:26,667 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 845 transitions. Word has length 152 [2023-12-19 15:21:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:26,667 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 845 transitions. [2023-12-19 15:21:26,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 845 transitions. [2023-12-19 15:21:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-19 15:21:26,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:26,668 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:26,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-19 15:21:26,668 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:26,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1500516528, now seen corresponding path program 1 times [2023-12-19 15:21:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875955829] [2023-12-19 15:21:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875955829] [2023-12-19 15:21:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875955829] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:26,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:26,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:21:26,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6005118] [2023-12-19 15:21:26,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:26,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:21:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:26,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:21:26,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:21:26,788 INFO L87 Difference]: Start difference. First operand 576 states and 845 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:26,925 INFO L93 Difference]: Finished difference Result 1222 states and 1741 transitions. [2023-12-19 15:21:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:21:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-12-19 15:21:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:26,927 INFO L225 Difference]: With dead ends: 1222 [2023-12-19 15:21:26,927 INFO L226 Difference]: Without dead ends: 779 [2023-12-19 15:21:26,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:21:26,928 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 92 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:26,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 638 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:21:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-12-19 15:21:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 706. [2023-12-19 15:21:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 661 states have (on average 1.384266263237519) internal successors, (915), 661 states have internal predecessors, (915), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 15:21:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 991 transitions. [2023-12-19 15:21:26,982 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 991 transitions. Word has length 153 [2023-12-19 15:21:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:26,982 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 991 transitions. [2023-12-19 15:21:26,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 991 transitions. [2023-12-19 15:21:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-19 15:21:26,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:26,983 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:26,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-19 15:21:26,983 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:26,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1171969398, now seen corresponding path program 1 times [2023-12-19 15:21:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079577038] [2023-12-19 15:21:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:27,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:27,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079577038] [2023-12-19 15:21:27,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079577038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:27,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:27,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:21:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204416176] [2023-12-19 15:21:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:27,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:21:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:27,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:21:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:21:27,035 INFO L87 Difference]: Start difference. First operand 706 states and 991 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:27,094 INFO L93 Difference]: Finished difference Result 1266 states and 1777 transitions. [2023-12-19 15:21:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:21:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-12-19 15:21:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:27,097 INFO L225 Difference]: With dead ends: 1266 [2023-12-19 15:21:27,097 INFO L226 Difference]: Without dead ends: 709 [2023-12-19 15:21:27,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 15:21:27,097 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:27,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 320 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:21:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2023-12-19 15:21:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 707. [2023-12-19 15:21:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 662 states have (on average 1.3836858006042296) internal successors, (916), 662 states have internal predecessors, (916), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 15:21:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 992 transitions. [2023-12-19 15:21:27,150 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 992 transitions. Word has length 153 [2023-12-19 15:21:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:27,150 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 992 transitions. [2023-12-19 15:21:27,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 992 transitions. [2023-12-19 15:21:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-19 15:21:27,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:27,152 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:27,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-19 15:21:27,152 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:27,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1114711096, now seen corresponding path program 1 times [2023-12-19 15:21:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84086876] [2023-12-19 15:21:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:27,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84086876] [2023-12-19 15:21:27,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84086876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:27,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:27,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:21:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572092050] [2023-12-19 15:21:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:27,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:21:27,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:21:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:21:27,518 INFO L87 Difference]: Start difference. First operand 707 states and 992 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:27,708 INFO L93 Difference]: Finished difference Result 1116 states and 1528 transitions. [2023-12-19 15:21:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:21:27,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-12-19 15:21:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:27,719 INFO L225 Difference]: With dead ends: 1116 [2023-12-19 15:21:27,719 INFO L226 Difference]: Without dead ends: 1114 [2023-12-19 15:21:27,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:21:27,719 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 265 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:27,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 742 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:21:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2023-12-19 15:21:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1101. [2023-12-19 15:21:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1056 states have (on average 1.3579545454545454) internal successors, (1434), 1056 states have internal predecessors, (1434), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 15:21:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1510 transitions. [2023-12-19 15:21:27,776 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1510 transitions. Word has length 153 [2023-12-19 15:21:27,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:27,776 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1510 transitions. [2023-12-19 15:21:27,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1510 transitions. [2023-12-19 15:21:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-19 15:21:27,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:27,777 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:27,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-19 15:21:27,777 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:27,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1990185380, now seen corresponding path program 1 times [2023-12-19 15:21:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:27,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308589838] [2023-12-19 15:21:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:28,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308589838] [2023-12-19 15:21:28,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308589838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:28,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:28,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:21:28,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673243639] [2023-12-19 15:21:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:28,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:21:28,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:21:28,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:21:28,229 INFO L87 Difference]: Start difference. First operand 1101 states and 1510 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:28,505 INFO L93 Difference]: Finished difference Result 2857 states and 3908 transitions. [2023-12-19 15:21:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:21:28,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2023-12-19 15:21:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:28,508 INFO L225 Difference]: With dead ends: 2857 [2023-12-19 15:21:28,508 INFO L226 Difference]: Without dead ends: 1957 [2023-12-19 15:21:28,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:21:28,510 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 419 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:28,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 743 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2023-12-19 15:21:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1551. [2023-12-19 15:21:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1506 states have (on average 1.3718459495351925) internal successors, (2066), 1506 states have internal predecessors, (2066), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 15:21:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2142 transitions. [2023-12-19 15:21:28,573 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2142 transitions. Word has length 155 [2023-12-19 15:21:28,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:28,574 INFO L495 AbstractCegarLoop]: Abstraction has 1551 states and 2142 transitions. [2023-12-19 15:21:28,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2142 transitions. [2023-12-19 15:21:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-19 15:21:28,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:28,575 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:28,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-19 15:21:28,576 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:28,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:28,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1480712290, now seen corresponding path program 1 times [2023-12-19 15:21:28,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:28,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209576357] [2023-12-19 15:21:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:29,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209576357] [2023-12-19 15:21:29,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209576357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:29,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:29,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:21:29,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627500321] [2023-12-19 15:21:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:29,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:21:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:29,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:21:29,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:21:29,018 INFO L87 Difference]: Start difference. First operand 1551 states and 2142 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:29,358 INFO L93 Difference]: Finished difference Result 3251 states and 4457 transitions. [2023-12-19 15:21:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:21:29,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2023-12-19 15:21:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:29,364 INFO L225 Difference]: With dead ends: 3251 [2023-12-19 15:21:29,364 INFO L226 Difference]: Without dead ends: 1965 [2023-12-19 15:21:29,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:21:29,372 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 473 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:29,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 777 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2023-12-19 15:21:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1568. [2023-12-19 15:21:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1520 states have (on average 1.3703947368421052) internal successors, (2083), 1521 states have internal predecessors, (2083), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:21:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2163 transitions. [2023-12-19 15:21:29,450 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2163 transitions. Word has length 155 [2023-12-19 15:21:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:29,451 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2163 transitions. [2023-12-19 15:21:29,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2163 transitions. [2023-12-19 15:21:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-19 15:21:29,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:29,453 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:29,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-19 15:21:29,453 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:29,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash 28541320, now seen corresponding path program 1 times [2023-12-19 15:21:29,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:29,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933035850] [2023-12-19 15:21:29,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:29,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:29,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:29,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933035850] [2023-12-19 15:21:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933035850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:29,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:29,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:21:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075379893] [2023-12-19 15:21:29,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:29,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:21:29,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:21:29,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:21:29,568 INFO L87 Difference]: Start difference. First operand 1568 states and 2163 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:29,648 INFO L93 Difference]: Finished difference Result 2943 states and 4053 transitions. [2023-12-19 15:21:29,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:21:29,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2023-12-19 15:21:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:29,651 INFO L225 Difference]: With dead ends: 2943 [2023-12-19 15:21:29,651 INFO L226 Difference]: Without dead ends: 1568 [2023-12-19 15:21:29,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:21:29,653 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:29,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 480 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:21:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2023-12-19 15:21:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2023-12-19 15:21:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1520 states have (on average 1.2914473684210526) internal successors, (1963), 1521 states have internal predecessors, (1963), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:21:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2043 transitions. [2023-12-19 15:21:29,732 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2043 transitions. Word has length 155 [2023-12-19 15:21:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:29,732 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2043 transitions. [2023-12-19 15:21:29,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2043 transitions. [2023-12-19 15:21:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-19 15:21:29,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:29,734 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:29,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-19 15:21:29,734 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:29,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:29,735 INFO L85 PathProgramCache]: Analyzing trace with hash 275871519, now seen corresponding path program 1 times [2023-12-19 15:21:29,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:29,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987130096] [2023-12-19 15:21:29,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:29,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:29,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987130096] [2023-12-19 15:21:29,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987130096] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:29,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:29,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:21:29,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042227842] [2023-12-19 15:21:29,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:29,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:21:29,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:21:29,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:21:29,948 INFO L87 Difference]: Start difference. First operand 1568 states and 2043 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:30,235 INFO L93 Difference]: Finished difference Result 2983 states and 3879 transitions. [2023-12-19 15:21:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:21:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2023-12-19 15:21:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:30,237 INFO L225 Difference]: With dead ends: 2983 [2023-12-19 15:21:30,237 INFO L226 Difference]: Without dead ends: 1656 [2023-12-19 15:21:30,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:21:30,239 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 295 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:30,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 544 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2023-12-19 15:21:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1568. [2023-12-19 15:21:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1520 states have (on average 1.2717105263157895) internal successors, (1933), 1521 states have internal predecessors, (1933), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:21:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2013 transitions. [2023-12-19 15:21:30,314 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2013 transitions. Word has length 156 [2023-12-19 15:21:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:30,314 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2013 transitions. [2023-12-19 15:21:30,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2013 transitions. [2023-12-19 15:21:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-19 15:21:30,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:30,316 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:30,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-19 15:21:30,316 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:30,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1529566815, now seen corresponding path program 1 times [2023-12-19 15:21:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075878514] [2023-12-19 15:21:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075878514] [2023-12-19 15:21:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075878514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:30,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:30,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:21:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383827958] [2023-12-19 15:21:30,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:30,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:21:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:30,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:21:30,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:21:30,587 INFO L87 Difference]: Start difference. First operand 1568 states and 2013 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:30,900 INFO L93 Difference]: Finished difference Result 3005 states and 3865 transitions. [2023-12-19 15:21:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:21:30,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2023-12-19 15:21:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:30,902 INFO L225 Difference]: With dead ends: 3005 [2023-12-19 15:21:30,902 INFO L226 Difference]: Without dead ends: 1702 [2023-12-19 15:21:30,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:21:30,903 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 305 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:30,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 551 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2023-12-19 15:21:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1568. [2023-12-19 15:21:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1520 states have (on average 1.269736842105263) internal successors, (1930), 1521 states have internal predecessors, (1930), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:21:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2010 transitions. [2023-12-19 15:21:30,979 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2010 transitions. Word has length 156 [2023-12-19 15:21:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:30,979 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2010 transitions. [2023-12-19 15:21:30,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2010 transitions. [2023-12-19 15:21:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-19 15:21:30,981 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:30,981 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:30,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-19 15:21:30,981 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:30,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash -828502237, now seen corresponding path program 1 times [2023-12-19 15:21:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:30,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81298906] [2023-12-19 15:21:30,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81298906] [2023-12-19 15:21:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81298906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:21:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017136748] [2023-12-19 15:21:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:31,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:21:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:21:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:21:31,094 INFO L87 Difference]: Start difference. First operand 1568 states and 2010 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:31,253 INFO L93 Difference]: Finished difference Result 3021 states and 3873 transitions. [2023-12-19 15:21:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:21:31,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2023-12-19 15:21:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:31,256 INFO L225 Difference]: With dead ends: 3021 [2023-12-19 15:21:31,256 INFO L226 Difference]: Without dead ends: 1718 [2023-12-19 15:21:31,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:21:31,257 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 103 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:31,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1020 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:21:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2023-12-19 15:21:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1565. [2023-12-19 15:21:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1517 states have (on average 1.2702702702702702) internal successors, (1927), 1518 states have internal predecessors, (1927), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:21:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2007 transitions. [2023-12-19 15:21:31,338 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2007 transitions. Word has length 156 [2023-12-19 15:21:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:31,338 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 2007 transitions. [2023-12-19 15:21:31,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2007 transitions. [2023-12-19 15:21:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-19 15:21:31,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:31,340 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:31,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-12-19 15:21:31,341 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:31,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1708371423, now seen corresponding path program 1 times [2023-12-19 15:21:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493991186] [2023-12-19 15:21:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:31,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:31,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493991186] [2023-12-19 15:21:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493991186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:31,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:31,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:21:31,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614631749] [2023-12-19 15:21:31,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:31,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:21:31,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:31,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:21:31,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:21:31,507 INFO L87 Difference]: Start difference. First operand 1565 states and 2007 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:31,901 INFO L93 Difference]: Finished difference Result 3998 states and 5072 transitions. [2023-12-19 15:21:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:21:31,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2023-12-19 15:21:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:31,904 INFO L225 Difference]: With dead ends: 3998 [2023-12-19 15:21:31,904 INFO L226 Difference]: Without dead ends: 2698 [2023-12-19 15:21:31,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:21:31,905 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 261 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:31,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 862 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2023-12-19 15:21:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2000. [2023-12-19 15:21:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1952 states have (on average 1.257172131147541) internal successors, (2454), 1953 states have internal predecessors, (2454), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:21:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2534 transitions. [2023-12-19 15:21:31,984 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2534 transitions. Word has length 156 [2023-12-19 15:21:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:31,985 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2534 transitions. [2023-12-19 15:21:31,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2534 transitions. [2023-12-19 15:21:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-19 15:21:31,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:31,986 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:31,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-19 15:21:31,986 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:31,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash 811588511, now seen corresponding path program 1 times [2023-12-19 15:21:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720275753] [2023-12-19 15:21:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:32,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720275753] [2023-12-19 15:21:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720275753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:32,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:32,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:21:32,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69971976] [2023-12-19 15:21:32,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:32,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:21:32,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:32,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:21:32,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:21:32,445 INFO L87 Difference]: Start difference. First operand 2000 states and 2534 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:32,705 INFO L93 Difference]: Finished difference Result 3317 states and 4222 transitions. [2023-12-19 15:21:32,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:21:32,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 156 [2023-12-19 15:21:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:32,707 INFO L225 Difference]: With dead ends: 3317 [2023-12-19 15:21:32,707 INFO L226 Difference]: Without dead ends: 2013 [2023-12-19 15:21:32,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:21:32,709 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 367 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:32,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 592 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2023-12-19 15:21:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 2000. [2023-12-19 15:21:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1952 states have (on average 1.2551229508196722) internal successors, (2450), 1953 states have internal predecessors, (2450), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:21:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2530 transitions. [2023-12-19 15:21:32,785 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2530 transitions. Word has length 156 [2023-12-19 15:21:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:32,785 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2530 transitions. [2023-12-19 15:21:32,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2530 transitions. [2023-12-19 15:21:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-19 15:21:32,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:32,787 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:32,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-12-19 15:21:32,787 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:32,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1491646881, now seen corresponding path program 1 times [2023-12-19 15:21:32,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:32,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113762800] [2023-12-19 15:21:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:33,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:33,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113762800] [2023-12-19 15:21:33,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113762800] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:33,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:33,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:21:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706002745] [2023-12-19 15:21:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:33,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:21:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:21:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:21:33,271 INFO L87 Difference]: Start difference. First operand 2000 states and 2530 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:33,559 INFO L93 Difference]: Finished difference Result 3319 states and 4215 transitions. [2023-12-19 15:21:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:21:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 156 [2023-12-19 15:21:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:33,562 INFO L225 Difference]: With dead ends: 3319 [2023-12-19 15:21:33,562 INFO L226 Difference]: Without dead ends: 2018 [2023-12-19 15:21:33,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:21:33,564 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 482 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:33,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 586 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2023-12-19 15:21:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1876. [2023-12-19 15:21:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1827 states have (on average 1.2616310892172962) internal successors, (2305), 1828 states have internal predecessors, (2305), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:21:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2385 transitions. [2023-12-19 15:21:33,642 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2385 transitions. Word has length 156 [2023-12-19 15:21:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:33,642 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2385 transitions. [2023-12-19 15:21:33,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 15:21:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2385 transitions. [2023-12-19 15:21:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-19 15:21:33,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:33,644 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:33,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-12-19 15:21:33,644 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:33,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash 977471393, now seen corresponding path program 1 times [2023-12-19 15:21:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:33,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090348314] [2023-12-19 15:21:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:33,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-19 15:21:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090348314] [2023-12-19 15:21:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090348314] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:21:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577388303] [2023-12-19 15:21:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:21:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:21:34,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-19 15:21:34,061 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-19 15:21:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:34,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-19 15:21:34,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:21:34,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 15:21:34,704 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-19 15:21:35,028 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-19 15:21:35,028 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 1 case distinctions, treesize of input 25 treesize of output 20 [2023-12-19 15:21:35,046 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 15:21:35,046 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 28 treesize of output 12 [2023-12-19 15:21:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 312 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2023-12-19 15:21:35,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:21:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577388303] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:21:35,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 15:21:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2023-12-19 15:21:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658133887] [2023-12-19 15:21:35,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 15:21:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-19 15:21:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-19 15:21:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-12-19 15:21:35,230 INFO L87 Difference]: Start difference. First operand 1876 states and 2385 transitions. Second operand has 19 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2023-12-19 15:21:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:35,802 INFO L93 Difference]: Finished difference Result 3796 states and 4773 transitions. [2023-12-19 15:21:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:21:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 156 [2023-12-19 15:21:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:35,805 INFO L225 Difference]: With dead ends: 3796 [2023-12-19 15:21:35,805 INFO L226 Difference]: Without dead ends: 2250 [2023-12-19 15:21:35,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-12-19 15:21:35,807 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 516 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:35,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1223 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:21:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2023-12-19 15:21:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2229. [2023-12-19 15:21:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2171 states have (on average 1.221556886227545) internal successors, (2652), 2174 states have internal predecessors, (2652), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 15:21:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2744 transitions. [2023-12-19 15:21:35,923 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2744 transitions. Word has length 156 [2023-12-19 15:21:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:35,923 INFO L495 AbstractCegarLoop]: Abstraction has 2229 states and 2744 transitions. [2023-12-19 15:21:35,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2023-12-19 15:21:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2744 transitions. [2023-12-19 15:21:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-19 15:21:35,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:35,925 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:35,933 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-19 15:21:36,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:21:36,125 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:36,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1928148925, now seen corresponding path program 1 times [2023-12-19 15:21:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919936371] [2023-12-19 15:21:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:21:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:21:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:21:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:21:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:21:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:21:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:21:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:21:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:21:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:21:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:21:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:21:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:21:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:21:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:21:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:21:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 15:21:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 15:21:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 15:21:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:21:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919936371] [2023-12-19 15:21:36,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919936371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:36,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:36,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:21:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516069138] [2023-12-19 15:21:36,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:36,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:21:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:21:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:21:36,669 INFO L87 Difference]: Start difference. First operand 2229 states and 2744 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:37,054 INFO L93 Difference]: Finished difference Result 3299 states and 4000 transitions. [2023-12-19 15:21:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 15:21:37,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2023-12-19 15:21:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:37,058 INFO L225 Difference]: With dead ends: 3299 [2023-12-19 15:21:37,058 INFO L226 Difference]: Without dead ends: 3297 [2023-12-19 15:21:37,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:21:37,059 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 220 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:37,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1252 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:21:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2023-12-19 15:21:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3279. [2023-12-19 15:21:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3221 states have (on average 1.2058366966780503) internal successors, (3884), 3224 states have internal predecessors, (3884), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 15:21:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 3976 transitions. [2023-12-19 15:21:37,182 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 3976 transitions. Word has length 158 [2023-12-19 15:21:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:37,182 INFO L495 AbstractCegarLoop]: Abstraction has 3279 states and 3976 transitions. [2023-12-19 15:21:37,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 15:21:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 3976 transitions. [2023-12-19 15:21:37,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-19 15:21:37,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:37,185 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:37,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-12-19 15:21:37,185 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:37,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1758714821, now seen corresponding path program 1 times [2023-12-19 15:21:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:37,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119178327] [2023-12-19 15:21:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:21:37,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:21:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:21:37,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:21:37,351 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:21:37,351 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:21:37,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-12-19 15:21:37,354 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:21:37,357 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:21:37,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:21:37 BoogieIcfgContainer [2023-12-19 15:21:37,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:21:37,466 INFO L158 Benchmark]: Toolchain (without parser) took 63575.32ms. Allocated memory was 295.7MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 245.0MB in the beginning and 427.3MB in the end (delta: -182.2MB). Peak memory consumption was 587.9MB. Max. memory is 8.0GB. [2023-12-19 15:21:37,466 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:21:37,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.30ms. Allocated memory is still 295.7MB. Free memory was 245.0MB in the beginning and 228.7MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-19 15:21:37,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.95ms. Allocated memory is still 295.7MB. Free memory was 228.7MB in the beginning and 223.8MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:21:37,467 INFO L158 Benchmark]: Boogie Preprocessor took 74.16ms. Allocated memory is still 295.7MB. Free memory was 223.8MB in the beginning and 218.5MB in the end (delta: 5.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:21:37,467 INFO L158 Benchmark]: RCFGBuilder took 615.52ms. Allocated memory is still 295.7MB. Free memory was 218.5MB in the beginning and 233.1MB in the end (delta: -14.6MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2023-12-19 15:21:37,470 INFO L158 Benchmark]: TraceAbstraction took 62603.67ms. Allocated memory was 295.7MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 232.6MB in the beginning and 427.3MB in the end (delta: -194.6MB). Peak memory consumption was 574.6MB. Max. memory is 8.0GB. [2023-12-19 15:21:37,470 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.11ms. Allocated memory is still 215.0MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.30ms. Allocated memory is still 295.7MB. Free memory was 245.0MB in the beginning and 228.7MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.95ms. Allocated memory is still 295.7MB. Free memory was 228.7MB in the beginning and 223.8MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.16ms. Allocated memory is still 295.7MB. Free memory was 223.8MB in the beginning and 218.5MB in the end (delta: 5.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 615.52ms. Allocated memory is still 295.7MB. Free memory was 218.5MB in the beginning and 233.1MB in the end (delta: -14.6MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. * TraceAbstraction took 62603.67ms. Allocated memory was 295.7MB in the beginning and 1.1GB in the end (delta: 769.7MB). Free memory was 232.6MB in the beginning and 427.3MB in the end (delta: -194.6MB). Peak memory consumption was 574.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[2]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[3]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[4]); [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L33] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0][0]); [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1][0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[0][1]); [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer = &(unsigned_char_Array_0[1][1]); [L46] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer = &(unsigned_char_Array_0[0][2]); [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer = &(unsigned_char_Array_0[1][2]); [L48] unsigned char last_1_unsigned_char_Array_0_0__1_ = 64; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L115] EXPR unsigned_char_Array_0[0][1] [L115] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L84] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L87] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L90] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L91] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L93] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L94] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L96] double_Array_0[1] = __VERIFIER_nondet_double() [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L98] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L99] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] RET assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L101] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L102] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L104] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L107] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L108] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L110] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L111] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, cond=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L126] RET updateVariables() [L127] CALL step() [L52] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] COND TRUE (last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_ [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) = (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L57] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L60] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L61] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L68] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L68] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) [L73] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L73] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L74] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L74] unsigned char stepLocal_0 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)); [L75] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L75] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, stepLocal_0=1, stepLocal_1=64, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] COND TRUE stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L77] COND TRUE stepLocal_1 > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) [L78] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L78] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118-L119] return (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=0, cond=0, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=0, cond=0, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.5s, OverallIterations: 53, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18764 SdHoareTripleChecker+Valid, 17.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18738 mSDsluCounter, 52449 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42444 mSDsCounter, 1753 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26030 IncrementalHoareTripleChecker+Invalid, 27783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1753 mSolverCounterUnsat, 10005 mSDtfsCounter, 26030 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3135 GetRequests, 2437 SyntacticMatches, 3 SemanticMatches, 695 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3279occurred in iteration=52, InterpolantAutomatonStates: 506, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 52 MinimizatonAttempts, 7123 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 8124 NumberOfCodeBlocks, 8124 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 7913 ConstructedInterpolants, 0 QuantifiedInterpolants, 61755 SizeOfPredicates, 10 NumberOfNonLiveVariables, 586 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 53 InterpolantComputations, 51 PerfectInterpolantSequences, 35901/36252 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-19 15:21:37,499 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...