/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-39.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:18:52,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:18:52,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:18:52,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:18:52,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:18:52,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:18:52,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:18:52,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:18:52,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:18:52,272 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:18:52,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:18:52,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:18:52,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:18:52,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:18:52,274 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:18:52,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:18:52,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:18:52,274 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:18:52,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:18:52,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:18:52,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:18:52,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:18:52,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:18:52,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:18:52,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:18:52,276 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:18:52,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:18:52,276 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:18:52,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:18:52,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:18:52,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:18:52,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:18:52,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:52,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:18:52,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:18:52,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:18:52,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:18:52,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:18:52,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:18:52,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:18:52,279 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:18:52,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:18:52,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:18:52,280 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:18:52,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:18:52,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:18:52,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:18:52,702 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:18:52,702 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:18:52,703 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-39.i [2023-12-16 04:18:54,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:18:54,437 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:18:54,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2023-12-16 04:18:54,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c561a5e/b43c96d2467b4a68874d9be6f9799592/FLAG09b546f0b [2023-12-16 04:18:54,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c561a5e/b43c96d2467b4a68874d9be6f9799592 [2023-12-16 04:18:54,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:18:54,474 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:18:54,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:54,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:18:54,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:18:54,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:54" (1/1) ... [2023-12-16 04:18:54,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66207440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:54, skipping insertion in model container [2023-12-16 04:18:54,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:54" (1/1) ... [2023-12-16 04:18:54,563 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:18:54,740 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-39.i[916,929] [2023-12-16 04:18:54,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:54,866 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:18:54,874 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-39.i[916,929] [2023-12-16 04:18:55,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:55,049 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:18:55,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55 WrapperNode [2023-12-16 04:18:55,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:55,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:55,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:18:55,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:18:55,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,158 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 596 [2023-12-16 04:18:55,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:55,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:18:55,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:18:55,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:18:55,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,234 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2023-12-16 04:18:55,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:18:55,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:18:55,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:18:55,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:18:55,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (1/1) ... [2023-12-16 04:18:55,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:55,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:55,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:18:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:18:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:18:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:18:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:18:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:18:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:18:55,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:18:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:18:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:18:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:18:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:18:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:18:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:18:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:18:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:18:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:18:55,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:18:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:18:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:18:55,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:18:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:18:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:18:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:18:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:18:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:18:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:18:55,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:18:55,751 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:18:55,753 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:18:56,372 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:18:56,410 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:18:56,418 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:18:56,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:56 BoogieIcfgContainer [2023-12-16 04:18:56,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:18:56,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:18:56,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:18:56,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:18:56,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:18:54" (1/3) ... [2023-12-16 04:18:56,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba2f021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:56, skipping insertion in model container [2023-12-16 04:18:56,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:55" (2/3) ... [2023-12-16 04:18:56,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba2f021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:56, skipping insertion in model container [2023-12-16 04:18:56,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:56" (3/3) ... [2023-12-16 04:18:56,425 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-39.i [2023-12-16 04:18:56,436 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:18:56,436 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:18:56,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:18:56,514 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;@7edc2d76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:18:56,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:18:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 89 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:18:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:18:56,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:56,549 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:56,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:56,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1923695525, now seen corresponding path program 1 times [2023-12-16 04:18:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:56,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67626328] [2023-12-16 04:18:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:18:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:18:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:18:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:18:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:18:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:18:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:18:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:18:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:18:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:18:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:18:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:18:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:18:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:18:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67626328] [2023-12-16 04:18:56,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67626328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:18:57,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738553532] [2023-12-16 04:18:57,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:57,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:18:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:18:57,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:18:57,033 INFO L87 Difference]: Start difference. First operand has 107 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 89 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:18:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:57,081 INFO L93 Difference]: Finished difference Result 211 states and 338 transitions. [2023-12-16 04:18:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:18:57,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2023-12-16 04:18:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:57,090 INFO L225 Difference]: With dead ends: 211 [2023-12-16 04:18:57,090 INFO L226 Difference]: Without dead ends: 105 [2023-12-16 04:18:57,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:18:57,096 INFO L413 NwaCegarLoop]: 153 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, 153 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:57,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-16 04:18:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-16 04:18:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:18:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 157 transitions. [2023-12-16 04:18:57,190 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 157 transitions. Word has length 121 [2023-12-16 04:18:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:57,191 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 157 transitions. [2023-12-16 04:18:57,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:18:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 157 transitions. [2023-12-16 04:18:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:18:57,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:57,193 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:57,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:18:57,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:57,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash 87059071, now seen corresponding path program 1 times [2023-12-16 04:18:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802756753] [2023-12-16 04:18:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:57,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:18:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:18:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:18:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:18:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:18:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:18:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:18:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:18:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:18:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:18:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:18:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:18:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:18:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:18:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:18:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:18:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:18:58,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:58,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802756753] [2023-12-16 04:18:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802756753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:58,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:58,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761136786] [2023-12-16 04:18:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:58,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:58,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:58,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:58,804 INFO L87 Difference]: Start difference. First operand 105 states and 157 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:18:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:59,214 INFO L93 Difference]: Finished difference Result 290 states and 434 transitions. [2023-12-16 04:18:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2023-12-16 04:18:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:59,219 INFO L225 Difference]: With dead ends: 290 [2023-12-16 04:18:59,219 INFO L226 Difference]: Without dead ends: 186 [2023-12-16 04:18:59,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:59,222 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 157 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:59,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 372 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:18:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-16 04:18:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2023-12-16 04:18:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 159 states have (on average 1.4654088050314464) internal successors, (233), 160 states have internal predecessors, (233), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 04:18:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 275 transitions. [2023-12-16 04:18:59,250 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 275 transitions. Word has length 121 [2023-12-16 04:18:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:59,251 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 275 transitions. [2023-12-16 04:18:59,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:18:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 275 transitions. [2023-12-16 04:18:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:18:59,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:59,252 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:59,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:18:59,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:59,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash 896405697, now seen corresponding path program 1 times [2023-12-16 04:18:59,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:59,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916734174] [2023-12-16 04:18:59,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:59,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:19:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:19:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:19:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:19:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:19:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:19:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-16 04:19:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:01,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916734174] [2023-12-16 04:19:01,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916734174] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:19:01,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090428460] [2023-12-16 04:19:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:01,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:01,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:19:01,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:19:01,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:19:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:02,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-16 04:19:02,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:19:02,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 04:19:02,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-16 04:19:03,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2023-12-16 04:19:04,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 212 [2023-12-16 04:19:04,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 200 [2023-12-16 04:19:04,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 96 [2023-12-16 04:19:05,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:19:05,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 151 treesize of output 67 [2023-12-16 04:19:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 341 proven. 60 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-12-16 04:19:05,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:19:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:19:06,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090428460] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:19:06,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:19:06,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 34] total 51 [2023-12-16 04:19:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121783938] [2023-12-16 04:19:06,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:06,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:19:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:19:06,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2235, Unknown=0, NotChecked=0, Total=2550 [2023-12-16 04:19:06,908 INFO L87 Difference]: Start difference. First operand 183 states and 275 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:08,026 INFO L93 Difference]: Finished difference Result 449 states and 670 transitions. [2023-12-16 04:19:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:19:08,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2023-12-16 04:19:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:08,032 INFO L225 Difference]: With dead ends: 449 [2023-12-16 04:19:08,032 INFO L226 Difference]: Without dead ends: 267 [2023-12-16 04:19:08,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=342, Invalid=2628, Unknown=0, NotChecked=0, Total=2970 [2023-12-16 04:19:08,037 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 308 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:08,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1028 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:19:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-12-16 04:19:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2023-12-16 04:19:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 231 states have (on average 1.4588744588744589) internal successors, (337), 233 states have internal predecessors, (337), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:19:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 393 transitions. [2023-12-16 04:19:08,062 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 393 transitions. Word has length 121 [2023-12-16 04:19:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:08,062 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 393 transitions. [2023-12-16 04:19:08,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 393 transitions. [2023-12-16 04:19:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:19:08,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:08,064 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:08,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:19:08,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:08,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:08,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash -924058179, now seen corresponding path program 1 times [2023-12-16 04:19:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:08,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58867129] [2023-12-16 04:19:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:19:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:19:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:19:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:19:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:19:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:19:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-16 04:19:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:10,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58867129] [2023-12-16 04:19:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58867129] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:19:10,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395020934] [2023-12-16 04:19:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:10,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:19:10,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:19:10,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:19:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:10,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 04:19:10,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:19:10,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 111 [2023-12-16 04:19:10,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:19:10,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 58 [2023-12-16 04:19:10,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2023-12-16 04:19:10,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:19:10,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 70 [2023-12-16 04:19:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:19:13,000 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:19:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395020934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:13,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:19:13,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 17 [2023-12-16 04:19:13,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506351355] [2023-12-16 04:19:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:13,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:19:13,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:13,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:19:13,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:19:13,002 INFO L87 Difference]: Start difference. First operand 264 states and 393 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:13,793 INFO L93 Difference]: Finished difference Result 560 states and 830 transitions. [2023-12-16 04:19:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:19:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2023-12-16 04:19:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:13,796 INFO L225 Difference]: With dead ends: 560 [2023-12-16 04:19:13,796 INFO L226 Difference]: Without dead ends: 297 [2023-12-16 04:19:13,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:19:13,797 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 173 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:13,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 937 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:19:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-16 04:19:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 213. [2023-12-16 04:19:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 185 states have (on average 1.4432432432432432) internal successors, (267), 186 states have internal predecessors, (267), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-16 04:19:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 313 transitions. [2023-12-16 04:19:13,809 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 313 transitions. Word has length 121 [2023-12-16 04:19:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:13,810 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 313 transitions. [2023-12-16 04:19:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 313 transitions. [2023-12-16 04:19:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:19:13,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:13,815 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:13,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:19:14,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-16 04:19:14,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:14,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash -114711553, now seen corresponding path program 1 times [2023-12-16 04:19:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111479806] [2023-12-16 04:19:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:19:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:19:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:19:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:19:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:19:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:19:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:19:14,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111479806] [2023-12-16 04:19:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111479806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:14,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:14,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:19:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654632686] [2023-12-16 04:19:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:14,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:19:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:19:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:19:14,574 INFO L87 Difference]: Start difference. First operand 213 states and 313 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:14,810 INFO L93 Difference]: Finished difference Result 483 states and 709 transitions. [2023-12-16 04:19:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:19:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2023-12-16 04:19:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:14,812 INFO L225 Difference]: With dead ends: 483 [2023-12-16 04:19:14,813 INFO L226 Difference]: Without dead ends: 271 [2023-12-16 04:19:14,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:19:14,813 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 155 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:14,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 611 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:19:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-16 04:19:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 213. [2023-12-16 04:19:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 185 states have (on average 1.4378378378378378) internal successors, (266), 186 states have internal predecessors, (266), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-16 04:19:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 312 transitions. [2023-12-16 04:19:14,827 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 312 transitions. Word has length 121 [2023-12-16 04:19:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:14,827 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 312 transitions. [2023-12-16 04:19:14,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 312 transitions. [2023-12-16 04:19:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 04:19:14,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:14,829 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:14,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:19:14,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:14,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2094882122, now seen corresponding path program 1 times [2023-12-16 04:19:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749161949] [2023-12-16 04:19:14,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:19:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:19:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:19:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:19:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:19:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:19:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:19:15,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749161949] [2023-12-16 04:19:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749161949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:15,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:19:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572675264] [2023-12-16 04:19:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:15,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:19:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:15,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:19:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:19:15,067 INFO L87 Difference]: Start difference. First operand 213 states and 312 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:15,278 INFO L93 Difference]: Finished difference Result 547 states and 801 transitions. [2023-12-16 04:19:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:19:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2023-12-16 04:19:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:15,279 INFO L225 Difference]: With dead ends: 547 [2023-12-16 04:19:15,279 INFO L226 Difference]: Without dead ends: 335 [2023-12-16 04:19:15,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:19:15,280 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 251 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:15,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 748 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:19:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-12-16 04:19:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 232. [2023-12-16 04:19:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.4411764705882353) internal successors, (294), 205 states have internal predecessors, (294), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-16 04:19:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 340 transitions. [2023-12-16 04:19:15,309 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 340 transitions. Word has length 123 [2023-12-16 04:19:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:15,310 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 340 transitions. [2023-12-16 04:19:15,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 340 transitions. [2023-12-16 04:19:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 04:19:15,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:15,311 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:15,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:19:15,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:15,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash -521207601, now seen corresponding path program 1 times [2023-12-16 04:19:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:15,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242119693] [2023-12-16 04:19:15,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:19:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:19:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:19:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:19:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:19:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:19:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-16 04:19:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:17,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242119693] [2023-12-16 04:19:17,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242119693] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:19:17,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830614252] [2023-12-16 04:19:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:17,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:17,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:19:17,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:19:17,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:19:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:17,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 04:19:17,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:19:17,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 127 [2023-12-16 04:19:17,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 133 [2023-12-16 04:19:17,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2023-12-16 04:19:17,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:19:17,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 66 [2023-12-16 04:19:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-12-16 04:19:17,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:19:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:19:18,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830614252] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:19:18,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:19:18,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 13] total 26 [2023-12-16 04:19:18,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440972108] [2023-12-16 04:19:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:18,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:19:18,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:18,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:19:18,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-12-16 04:19:18,611 INFO L87 Difference]: Start difference. First operand 232 states and 340 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:19,494 INFO L93 Difference]: Finished difference Result 529 states and 772 transitions. [2023-12-16 04:19:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:19:19,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-16 04:19:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:19,496 INFO L225 Difference]: With dead ends: 529 [2023-12-16 04:19:19,496 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 04:19:19,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2023-12-16 04:19:19,497 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 303 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:19,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1124 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:19:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 04:19:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 233. [2023-12-16 04:19:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 205 states have (on average 1.4390243902439024) internal successors, (295), 206 states have internal predecessors, (295), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-16 04:19:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 341 transitions. [2023-12-16 04:19:19,508 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 341 transitions. Word has length 124 [2023-12-16 04:19:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:19,509 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 341 transitions. [2023-12-16 04:19:19,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 341 transitions. [2023-12-16 04:19:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 04:19:19,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:19,510 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:19,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:19:19,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:19,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:19,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash -672689070, now seen corresponding path program 1 times [2023-12-16 04:19:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:19,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662810628] [2023-12-16 04:19:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:19:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:19:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:19:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:19:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:19:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:19:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:19:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:20,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662810628] [2023-12-16 04:19:20,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662810628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:20,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:20,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:19:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597932543] [2023-12-16 04:19:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:19:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:19:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:19:20,326 INFO L87 Difference]: Start difference. First operand 233 states and 341 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:20,589 INFO L93 Difference]: Finished difference Result 396 states and 565 transitions. [2023-12-16 04:19:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:19:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2023-12-16 04:19:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:20,592 INFO L225 Difference]: With dead ends: 396 [2023-12-16 04:19:20,592 INFO L226 Difference]: Without dead ends: 394 [2023-12-16 04:19:20,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:19:20,593 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 145 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:20,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 792 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:19:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-16 04:19:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2023-12-16 04:19:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 341 states have (on average 1.401759530791789) internal successors, (478), 344 states have internal predecessors, (478), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-16 04:19:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 560 transitions. [2023-12-16 04:19:20,616 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 560 transitions. Word has length 125 [2023-12-16 04:19:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:20,616 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 560 transitions. [2023-12-16 04:19:20,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:19:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 560 transitions. [2023-12-16 04:19:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:19:20,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:20,617 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:20,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:19:20,617 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:20,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash 856509098, now seen corresponding path program 1 times [2023-12-16 04:19:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744603059] [2023-12-16 04:19:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:20,637 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:19:20,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523199937] [2023-12-16 04:19:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:20,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:20,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:19:20,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:19:20,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:19:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:19:20,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:19:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:19:21,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:19:21,135 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:19:21,135 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:19:21,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:19:21,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:19:21,346 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:21,349 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:19:21,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:19:21 BoogieIcfgContainer [2023-12-16 04:19:21,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:19:21,404 INFO L158 Benchmark]: Toolchain (without parser) took 26929.89ms. Allocated memory was 277.9MB in the beginning and 613.4MB in the end (delta: 335.5MB). Free memory was 225.5MB in the beginning and 435.5MB in the end (delta: -210.1MB). Peak memory consumption was 127.1MB. Max. memory is 8.0GB. [2023-12-16 04:19:21,404 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:19:21,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.66ms. Allocated memory is still 277.9MB. Free memory was 225.5MB in the beginning and 209.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 04:19:21,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.81ms. Allocated memory is still 277.9MB. Free memory was 209.2MB in the beginning and 205.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:19:21,404 INFO L158 Benchmark]: Boogie Preprocessor took 150.17ms. Allocated memory is still 277.9MB. Free memory was 205.0MB in the beginning and 199.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:19:21,405 INFO L158 Benchmark]: RCFGBuilder took 1109.73ms. Allocated memory is still 277.9MB. Free memory was 199.8MB in the beginning and 162.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-16 04:19:21,405 INFO L158 Benchmark]: TraceAbstraction took 24982.94ms. Allocated memory was 277.9MB in the beginning and 613.4MB in the end (delta: 335.5MB). Free memory was 161.5MB in the beginning and 435.5MB in the end (delta: -274.0MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. [2023-12-16 04:19:21,406 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.09ms. Allocated memory is still 179.3MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 568.66ms. Allocated memory is still 277.9MB. Free memory was 225.5MB in the beginning and 209.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 89.81ms. Allocated memory is still 277.9MB. Free memory was 209.2MB in the beginning and 205.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 150.17ms. Allocated memory is still 277.9MB. Free memory was 205.0MB in the beginning and 199.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1109.73ms. Allocated memory is still 277.9MB. Free memory was 199.8MB in the beginning and 162.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 24982.94ms. Allocated memory was 277.9MB in the beginning and 613.4MB in the end (delta: 335.5MB). Free memory was 161.5MB in the beginning and 435.5MB in the end (delta: -274.0MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of bitwise operation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 64 }; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] float_Array_0[0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L62] float_Array_0[1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] float_Array_0[2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L67] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L70] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L73] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L79] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L97] RET updateVariables() [L98] CALL step() [L37] EXPR signed_short_int_Array_0[3] [L37] EXPR signed_short_int_Array_0[2] [L37] EXPR signed_short_int_Array_0[1] [L37] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L37] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) [L37] EXPR signed_short_int_Array_0[1] [L37] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L37] signed_short_int_Array_0[4] = ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))) [L38] EXPR signed_short_int_Array_0[3] [L38] EXPR signed_short_int_Array_0[4] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] COND FALSE !(signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) [L45] EXPR signed_short_int_Array_0[1] [L45] signed_long_int_Array_0[2] = signed_short_int_Array_0[1] [L47] EXPR signed_long_int_Array_0[2] [L47] EXPR signed_short_int_Array_0[1] [L47] EXPR signed_short_int_Array_0[3] [L47] EXPR signed_short_int_Array_0[1] << signed_short_int_Array_0[3] [L47] signed long int stepLocal_1 = signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3]); [L48] EXPR signed_short_int_Array_0[3] [L48] EXPR signed_long_int_Array_0[0] [L48] EXPR signed_short_int_Array_0[0] [L48] signed long int stepLocal_0 = signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]); [L49] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L49] COND TRUE stepLocal_1 != signed_short_int_Array_0[0] [L50] EXPR signed_short_int_Array_0[2] [L50] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L50] COND FALSE !((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < stepLocal_0) [L53] EXPR signed_short_int_Array_0[1] [L53] signed_long_int_Array_0[1] = signed_short_int_Array_0[1] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR signed_short_int_Array_0[4] [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR signed_short_int_Array_0[2] [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR signed_short_int_Array_0[4] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) [L89] EXPR signed_long_int_Array_0[2] [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR (signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) [L89] EXPR signed_long_int_Array_0[2] [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR signed_short_int_Array_0[1] << signed_short_int_Array_0[3] [L89] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3])) [L89] EXPR signed_long_int_Array_0[1] [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR ((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3])) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89-L90] return ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1492 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1492 mSDsluCounter, 5765 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4366 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2629 IncrementalHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 1399 mSDtfsCounter, 2629 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 855 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 319 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1575 ConstructedInterpolants, 0 QuantifiedInterpolants, 14961 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1320 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 6138/6240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 04:19:21,459 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...