/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:49:18,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:49:18,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 01:49:18,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:49:18,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:49:18,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:49:18,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:49:18,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:49:18,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:49:18,173 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:49:18,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:49:18,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:49:18,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:49:18,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:49:18,175 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:49:18,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:49:18,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:49:18,176 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:49:18,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:49:18,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:49:18,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:49:18,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:49:18,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:49:18,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:49:18,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:49:18,177 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:49:18,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:49:18,178 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:49:18,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:49:18,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:49:18,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:49:18,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:49:18,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:49:18,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:49:18,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:49:18,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:49:18,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:49:18,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:49:18,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:49:18,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:49:18,181 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:49:18,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:49:18,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:49:18,181 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 01:49:18,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:49:18,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:49:18,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:49:18,378 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:49:18,378 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:49:18,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2023-12-21 01:49:19,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:49:19,640 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:49:19,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2023-12-21 01:49:19,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5db81f3/538da9ef5fd142149d766c9966e67c91/FLAGad5b22e04 [2023-12-21 01:49:19,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5db81f3/538da9ef5fd142149d766c9966e67c91 [2023-12-21 01:49:19,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:49:19,669 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:49:19,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:49:19,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:49:19,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:49:19,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:19,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1a8ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19, skipping insertion in model container [2023-12-21 01:49:19,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:19,699 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:49:19,791 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2023-12-21 01:49:19,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:49:19,858 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:49:19,867 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2023-12-21 01:49:19,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:49:19,941 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:49:19,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19 WrapperNode [2023-12-21 01:49:19,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:49:19,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:49:19,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:49:19,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:49:19,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:19,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,000 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2023-12-21 01:49:20,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:49:20,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:49:20,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:49:20,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:49:20,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,033 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 10, 6, 41, 74]. 56 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 2, 3, 8]. The 17 writes are split as follows [0, 1, 2, 3, 11]. [2023-12-21 01:49:20,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:49:20,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:49:20,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:49:20,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:49:20,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (1/1) ... [2023-12-21 01:49:20,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:49:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:49:20,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 01:49:20,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 01:49:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:49:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:49:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:49:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:49:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:49:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:49:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:49:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:49:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:49:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:49:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:49:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:49:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:49:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:49:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:49:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:49:20,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:49:20,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:49:20,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:49:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:49:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:49:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:49:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:49:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:49:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:49:20,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:49:20,239 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:49:20,241 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:49:20,606 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:49:20,628 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:49:20,628 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:49:20,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:49:20 BoogieIcfgContainer [2023-12-21 01:49:20,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:49:20,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:49:20,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:49:20,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:49:20,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:49:19" (1/3) ... [2023-12-21 01:49:20,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@834bd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:49:20, skipping insertion in model container [2023-12-21 01:49:20,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:19" (2/3) ... [2023-12-21 01:49:20,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@834bd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:49:20, skipping insertion in model container [2023-12-21 01:49:20,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:49:20" (3/3) ... [2023-12-21 01:49:20,634 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i [2023-12-21 01:49:20,646 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:49:20,647 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:49:20,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:49:20,690 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;@61cef176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:49:20,690 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:49:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 01:49:20,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:20,702 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:20,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:20,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash -235031558, now seen corresponding path program 1 times [2023-12-21 01:49:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544183081] [2023-12-21 01:49:20,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:20,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:20,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:21,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544183081] [2023-12-21 01:49:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544183081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:49:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767814297] [2023-12-21 01:49:21,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:21,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:49:21,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:21,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:49:21,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:49:21,106 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 01:49:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:21,136 INFO L93 Difference]: Finished difference Result 199 states and 312 transitions. [2023-12-21 01:49:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:49:21,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-12-21 01:49:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:21,142 INFO L225 Difference]: With dead ends: 199 [2023-12-21 01:49:21,142 INFO L226 Difference]: Without dead ends: 99 [2023-12-21 01:49:21,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:49:21,147 INFO L413 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:21,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-21 01:49:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-21 01:49:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-12-21 01:49:21,184 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 114 [2023-12-21 01:49:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:21,184 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-12-21 01:49:21,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 01:49:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-12-21 01:49:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 01:49:21,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:21,188 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:21,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:49:21,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:21,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1328970660, now seen corresponding path program 1 times [2023-12-21 01:49:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:21,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247541692] [2023-12-21 01:49:21,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:21,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247541692] [2023-12-21 01:49:21,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247541692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:21,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:21,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:49:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038843285] [2023-12-21 01:49:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:21,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:49:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:21,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:49:21,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:49:21,460 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 01:49:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:21,519 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2023-12-21 01:49:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:49:21,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-12-21 01:49:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:21,522 INFO L225 Difference]: With dead ends: 203 [2023-12-21 01:49:21,522 INFO L226 Difference]: Without dead ends: 105 [2023-12-21 01:49:21,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:49:21,523 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:21,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 403 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-21 01:49:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2023-12-21 01:49:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-12-21 01:49:21,534 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 114 [2023-12-21 01:49:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:21,534 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-12-21 01:49:21,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 01:49:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-12-21 01:49:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 01:49:21,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:21,541 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:21,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:49:21,541 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:21,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash -568526106, now seen corresponding path program 1 times [2023-12-21 01:49:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:21,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207087550] [2023-12-21 01:49:21,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:21,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207087550] [2023-12-21 01:49:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207087550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:49:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032507002] [2023-12-21 01:49:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:21,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:49:21,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:21,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:49:21,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:49:21,828 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:21,875 INFO L93 Difference]: Finished difference Result 228 states and 323 transitions. [2023-12-21 01:49:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:49:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-21 01:49:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:21,879 INFO L225 Difference]: With dead ends: 228 [2023-12-21 01:49:21,879 INFO L226 Difference]: Without dead ends: 128 [2023-12-21 01:49:21,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:49:21,885 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 49 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:21,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 446 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-21 01:49:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 103. [2023-12-21 01:49:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2023-12-21 01:49:21,891 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 114 [2023-12-21 01:49:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:21,892 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2023-12-21 01:49:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2023-12-21 01:49:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 01:49:21,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:21,893 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:21,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:49:21,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:21,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 732962772, now seen corresponding path program 1 times [2023-12-21 01:49:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328286266] [2023-12-21 01:49:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:22,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328286266] [2023-12-21 01:49:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328286266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:22,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:49:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122690085] [2023-12-21 01:49:22,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:22,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:49:22,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:22,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:49:22,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:49:22,088 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:22,145 INFO L93 Difference]: Finished difference Result 258 states and 363 transitions. [2023-12-21 01:49:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:49:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2023-12-21 01:49:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:22,146 INFO L225 Difference]: With dead ends: 258 [2023-12-21 01:49:22,146 INFO L226 Difference]: Without dead ends: 156 [2023-12-21 01:49:22,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:49:22,152 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 86 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:22,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 662 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-21 01:49:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 104. [2023-12-21 01:49:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2023-12-21 01:49:22,167 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 116 [2023-12-21 01:49:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:22,167 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2023-12-21 01:49:22,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2023-12-21 01:49:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 01:49:22,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:22,169 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:22,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:49:22,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:22,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1492072083, now seen corresponding path program 1 times [2023-12-21 01:49:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:22,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604506731] [2023-12-21 01:49:22,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604506731] [2023-12-21 01:49:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604506731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:22,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:49:22,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467287797] [2023-12-21 01:49:22,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:22,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:49:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:49:22,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:49:22,307 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:22,334 INFO L93 Difference]: Finished difference Result 219 states and 308 transitions. [2023-12-21 01:49:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:49:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-12-21 01:49:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:22,336 INFO L225 Difference]: With dead ends: 219 [2023-12-21 01:49:22,336 INFO L226 Difference]: Without dead ends: 116 [2023-12-21 01:49:22,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:49:22,337 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 21 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:22,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 402 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-21 01:49:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2023-12-21 01:49:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2023-12-21 01:49:22,355 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 118 [2023-12-21 01:49:22,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:22,357 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2023-12-21 01:49:22,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2023-12-21 01:49:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 01:49:22,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:22,359 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:22,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:49:22,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:22,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1993548587, now seen corresponding path program 1 times [2023-12-21 01:49:22,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:22,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186779157] [2023-12-21 01:49:22,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186779157] [2023-12-21 01:49:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186779157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:49:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971698679] [2023-12-21 01:49:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:22,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:49:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:49:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:49:22,468 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:22,494 INFO L93 Difference]: Finished difference Result 219 states and 306 transitions. [2023-12-21 01:49:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:49:22,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-12-21 01:49:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:22,496 INFO L225 Difference]: With dead ends: 219 [2023-12-21 01:49:22,496 INFO L226 Difference]: Without dead ends: 114 [2023-12-21 01:49:22,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:49:22,497 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 12 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:22,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 400 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-21 01:49:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-12-21 01:49:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2023-12-21 01:49:22,505 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 118 [2023-12-21 01:49:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:22,505 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2023-12-21 01:49:22,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2023-12-21 01:49:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 01:49:22,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:22,507 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:22,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:49:22,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:22,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2050806889, now seen corresponding path program 1 times [2023-12-21 01:49:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:22,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005930669] [2023-12-21 01:49:22,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:22,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005930669] [2023-12-21 01:49:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005930669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:22,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:49:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537046392] [2023-12-21 01:49:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:22,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:49:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:49:22,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:49:22,614 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:22,641 INFO L93 Difference]: Finished difference Result 219 states and 304 transitions. [2023-12-21 01:49:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:49:22,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-12-21 01:49:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:22,642 INFO L225 Difference]: With dead ends: 219 [2023-12-21 01:49:22,642 INFO L226 Difference]: Without dead ends: 112 [2023-12-21 01:49:22,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:49:22,643 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 3 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:22,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 400 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-21 01:49:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-12-21 01:49:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2023-12-21 01:49:22,649 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 118 [2023-12-21 01:49:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:22,649 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2023-12-21 01:49:22,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 01:49:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2023-12-21 01:49:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 01:49:22,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:22,650 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:22,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:49:22,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:22,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2050866471, now seen corresponding path program 1 times [2023-12-21 01:49:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437833648] [2023-12-21 01:49:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:23,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437833648] [2023-12-21 01:49:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437833648] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:23,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:23,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118154450] [2023-12-21 01:49:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:23,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:23,073 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 01:49:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:23,135 INFO L93 Difference]: Finished difference Result 300 states and 410 transitions. [2023-12-21 01:49:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:49:23,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2023-12-21 01:49:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:23,136 INFO L225 Difference]: With dead ends: 300 [2023-12-21 01:49:23,136 INFO L226 Difference]: Without dead ends: 191 [2023-12-21 01:49:23,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:49:23,137 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 127 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:23,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 666 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-21 01:49:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 120. [2023-12-21 01:49:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:49:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 167 transitions. [2023-12-21 01:49:23,142 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 167 transitions. Word has length 118 [2023-12-21 01:49:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:23,142 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 167 transitions. [2023-12-21 01:49:23,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 01:49:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2023-12-21 01:49:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 01:49:23,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:23,143 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:23,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:49:23,143 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:23,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash 620416807, now seen corresponding path program 1 times [2023-12-21 01:49:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851792957] [2023-12-21 01:49:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:23,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:49:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:49:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:49:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 01:49:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851792957] [2023-12-21 01:49:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851792957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138762221] [2023-12-21 01:49:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:23,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:23,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:23,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:23,830 INFO L87 Difference]: Start difference. First operand 120 states and 167 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 01:49:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:24,014 INFO L93 Difference]: Finished difference Result 333 states and 463 transitions. [2023-12-21 01:49:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:49:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2023-12-21 01:49:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:24,015 INFO L225 Difference]: With dead ends: 333 [2023-12-21 01:49:24,015 INFO L226 Difference]: Without dead ends: 214 [2023-12-21 01:49:24,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:49:24,016 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:24,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 690 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:49:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-21 01:49:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2023-12-21 01:49:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 190 states have (on average 1.3526315789473684) internal successors, (257), 191 states have internal predecessors, (257), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:49:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 293 transitions. [2023-12-21 01:49:24,022 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 293 transitions. Word has length 118 [2023-12-21 01:49:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:24,022 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 293 transitions. [2023-12-21 01:49:24,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 01:49:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 293 transitions. [2023-12-21 01:49:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 01:49:24,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:24,023 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:24,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:49:24,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:24,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1218480610, now seen corresponding path program 1 times [2023-12-21 01:49:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:24,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481308471] [2023-12-21 01:49:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:49:24,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:49:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:49:24,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:49:24,148 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:49:24,149 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:49:24,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:49:24,152 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:24,154 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:49:24,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:49:24 BoogieIcfgContainer [2023-12-21 01:49:24,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:49:24,253 INFO L158 Benchmark]: Toolchain (without parser) took 4584.30ms. Allocated memory was 281.0MB in the beginning and 373.3MB in the end (delta: 92.3MB). Free memory was 232.4MB in the beginning and 337.7MB in the end (delta: -105.4MB). Peak memory consumption was 201.2MB. Max. memory is 8.0GB. [2023-12-21 01:49:24,254 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory was 124.5MB in the beginning and 124.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:49:24,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.59ms. Allocated memory is still 281.0MB. Free memory was 232.1MB in the beginning and 215.6MB in the end (delta: 16.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 01:49:24,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.26ms. Allocated memory is still 281.0MB. Free memory was 215.3MB in the beginning and 210.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:49:24,254 INFO L158 Benchmark]: Boogie Preprocessor took 62.72ms. Allocated memory is still 281.0MB. Free memory was 210.8MB in the beginning and 205.2MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 01:49:24,254 INFO L158 Benchmark]: RCFGBuilder took 561.68ms. Allocated memory is still 281.0MB. Free memory was 205.2MB in the beginning and 233.2MB in the end (delta: -28.0MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB. [2023-12-21 01:49:24,254 INFO L158 Benchmark]: TraceAbstraction took 3622.65ms. Allocated memory was 281.0MB in the beginning and 373.3MB in the end (delta: 92.3MB). Free memory was 232.7MB in the beginning and 337.7MB in the end (delta: -105.0MB). Peak memory consumption was 200.5MB. Max. memory is 8.0GB. [2023-12-21 01:49:24,255 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory was 124.5MB in the beginning and 124.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.59ms. Allocated memory is still 281.0MB. Free memory was 232.1MB in the beginning and 215.6MB in the end (delta: 16.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.26ms. Allocated memory is still 281.0MB. Free memory was 215.3MB in the beginning and 210.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.72ms. Allocated memory is still 281.0MB. Free memory was 210.8MB in the beginning and 205.2MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 561.68ms. Allocated memory is still 281.0MB. Free memory was 205.2MB in the beginning and 233.2MB in the end (delta: -28.0MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3622.65ms. Allocated memory was 281.0MB in the beginning and 373.3MB in the end (delta: 92.3MB). Free memory was 232.7MB in the beginning and 337.7MB in the end (delta: -105.0MB). Peak memory consumption was 200.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of bitwise operation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L34] unsigned char last_1_unsigned_char_Array_0_0__0__0_ = 2; [L35] unsigned char last_1_unsigned_char_Array_0_0__0__1_ = 0; [L36] unsigned char last_1_unsigned_char_Array_0_1__1__1_ = 32; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L92] EXPR unsigned_char_Array_0[0][0][0] [L92] last_1_unsigned_char_Array_0_0__0__0_ = unsigned_char_Array_0[0][0][0] [L93] EXPR unsigned_char_Array_0[0][0][1] [L93] last_1_unsigned_char_Array_0_0__0__1_ = unsigned_char_Array_0[0][0][1] [L94] EXPR unsigned_char_Array_0[1][1][1] [L94] last_1_unsigned_char_Array_0_1__1__1_ = unsigned_char_Array_0[1][1][1] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L75] unsigned_char_Array_0[1][0][0] = __VERIFIER_nondet_uchar() [L76] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L78] unsigned_char_Array_0[0][1][0] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] EXPR unsigned_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L81] unsigned_char_Array_0[1][1][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L84] unsigned_char_Array_0[1][0][1] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] EXPR unsigned_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L87] unsigned_char_Array_0[0][1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] EXPR unsigned_char_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L105] RET updateVariables() [L106] CALL step() [L40] EXPR last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_ [L40] signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_; [L41] COND FALSE !((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= stepLocal_0) [L44] EXPR unsigned_char_Array_0[0][1][0] [L44] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L44] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) [L44] EXPR unsigned_char_Array_0[1][1][0] [L44] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, stepLocal_0=-15, unsigned_char_Array_0={7:0}] [L44] unsigned_char_Array_0[1][1][1] = (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))) [L46] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L46] COND FALSE !(! BOOL_unsigned_char_Array_0[0]) [L51] EXPR float_Array_0[0] [L51] double_Array_0[0] = float_Array_0[0] [L52] EXPR unsigned_char_Array_0[1][0][0] [L52] unsigned_char_Array_0[0][0][1] = unsigned_char_Array_0[1][0][0] [L53] EXPR float_Array_0[1] [L53] double_Array_0[1] = float_Array_0[1] [L54] EXPR unsigned_char_Array_0[1][0][0] [L54] unsigned char stepLocal_1 = unsigned_char_Array_0[1][0][0]; [L55] EXPR unsigned_char_Array_0[1][1][1] [L55] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L55] COND FALSE !((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= stepLocal_1) [L64] EXPR unsigned_char_Array_0[1][0][0] [L64] unsigned_char_Array_0[0][0][0] = unsigned_char_Array_0[1][0][0] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1 [L97] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) [L97] EXPR last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))) [L97] EXPR unsigned_char_Array_0[1][1][1] [L97] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]) [L97] EXPR unsigned_char_Array_0[1][0][0] [L97] EXPR ((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97-L98] return ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 405 mSDsluCounter, 4206 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2874 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1332 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=9, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 173 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 1311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3276/3276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-21 01:49:24,306 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...