/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 21:29:11,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 21:29:11,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-01 21:29:11,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 21:29:11,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 21:29:11,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 21:29:11,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 21:29:11,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 21:29:11,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 21:29:11,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 21:29:11,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 21:29:11,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 21:29:11,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 21:29:11,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 21:29:11,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 21:29:11,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 21:29:11,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 21:29:11,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 21:29:11,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 21:29:11,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 21:29:11,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 21:29:11,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 21:29:11,383 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 21:29:11,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 21:29:11,383 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 21:29:11,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 21:29:11,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 21:29:11,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 21:29:11,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 21:29:11,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 21:29:11,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 21:29:11,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 21:29:11,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 21:29:11,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 21:29:11,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 21:29:11,385 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 21:29:11,385 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 21:29:11,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 21:29:11,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 21:29:11,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 21:29:11,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 21:29:11,387 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 21:29:11,387 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> bitwuzla [2024-11-01 21:29:11,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 21:29:11,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 21:29:11,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 21:29:11,678 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 21:29:11,678 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 21:29:11,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-01 21:29:12,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 21:29:13,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 21:29:13,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-01 21:29:13,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9fa97cd/d3ce5c1c58d94484bed8bb376db7a334/FLAG4f6b44aeb [2024-11-01 21:29:13,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9fa97cd/d3ce5c1c58d94484bed8bb376db7a334 [2024-11-01 21:29:13,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 21:29:13,555 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 21:29:13,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 21:29:13,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 21:29:13,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 21:29:13,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5851f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13, skipping insertion in model container [2024-11-01 21:29:13,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 21:29:13,698 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-11-01 21:29:13,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 21:29:13,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 21:29:13,780 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-11-01 21:29:13,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 21:29:13,835 INFO L204 MainTranslator]: Completed translation [2024-11-01 21:29:13,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13 WrapperNode [2024-11-01 21:29:13,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 21:29:13,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 21:29:13,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 21:29:13,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 21:29:13,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,881 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 248 [2024-11-01 21:29:13,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 21:29:13,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 21:29:13,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 21:29:13,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 21:29:13,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,919 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-01 21:29:13,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 21:29:13,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 21:29:13,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 21:29:13,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 21:29:13,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (1/1) ... [2024-11-01 21:29:13,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 21:29:13,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 21:29:13,978 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) [2024-11-01 21:29:13,980 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 [2024-11-01 21:29:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 21:29:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 21:29:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 21:29:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 21:29:14,093 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 21:29:14,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 21:29:14,341 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-01 21:29:14,341 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 21:29:14,349 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 21:29:14,350 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 21:29:14,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:29:14 BoogieIcfgContainer [2024-11-01 21:29:14,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 21:29:14,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 21:29:14,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 21:29:14,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 21:29:14,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 09:29:13" (1/3) ... [2024-11-01 21:29:14,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c218263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:29:14, skipping insertion in model container [2024-11-01 21:29:14,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:13" (2/3) ... [2024-11-01 21:29:14,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c218263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:29:14, skipping insertion in model container [2024-11-01 21:29:14,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:29:14" (3/3) ... [2024-11-01 21:29:14,357 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v5.c [2024-11-01 21:29:14,368 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 21:29:14,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 21:29:14,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 21:29:14,415 INFO L333 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, 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;@59c7322f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 21:29:14,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 21:29:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 21:29:14,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:29:14,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 21:29:14,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:29:14,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:29:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 21:29:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:29:14,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807727432] [2024-11-01 21:29:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:29:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:29:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:14,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:29:14,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-01 21:29:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:29:14,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-01 21:29:14,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:29:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:29:14,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:29:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:29:14,758 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:29:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807727432] [2024-11-01 21:29:14,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [807727432] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 21:29:14,759 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 21:29:14,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 21:29:14,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495218267] [2024-11-01 21:29:14,761 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 21:29:14,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 21:29:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:29:14,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 21:29:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 21:29:14,784 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:29:14,810 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-01 21:29:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 21:29:14,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-01 21:29:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:29:14,816 INFO L225 Difference]: With dead ends: 17 [2024-11-01 21:29:14,816 INFO L226 Difference]: Without dead ends: 9 [2024-11-01 21:29:14,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 21:29:14,821 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 21:29:14,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 21:29:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-01 21:29:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-01 21:29:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 21:29:14,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 21:29:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:29:14,841 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 21:29:14,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 21:29:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 21:29:14,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:29:14,842 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 21:29:14,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Ended with exit code 0 [2024-11-01 21:29:15,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:15,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:29:15,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:29:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 21:29:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:29:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599962412] [2024-11-01 21:29:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:29:15,045 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:29:15,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:15,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:29:15,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-01 21:29:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:29:15,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-01 21:29:15,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:29:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:29:15,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:29:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:29:15,587 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:29:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599962412] [2024-11-01 21:29:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1599962412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:29:15,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:29:15,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-01 21:29:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217019708] [2024-11-01 21:29:15,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:29:15,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-01 21:29:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:29:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-01 21:29:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-01 21:29:15,590 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:29:15,732 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-01 21:29:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-01 21:29:15,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-01 21:29:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:29:15,737 INFO L225 Difference]: With dead ends: 14 [2024-11-01 21:29:15,737 INFO L226 Difference]: Without dead ends: 12 [2024-11-01 21:29:15,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-01 21:29:15,738 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 21:29:15,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 21:29:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-01 21:29:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-01 21:29:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-01 21:29:15,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-01 21:29:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:29:15,746 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-01 21:29:15,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-01 21:29:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-01 21:29:15,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:29:15,747 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-01 21:29:15,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-01 21:29:15,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:15,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:29:15,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:29:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-01 21:29:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:29:15,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1941295105] [2024-11-01 21:29:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:29:15,954 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:29:15,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:15,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:29:15,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-01 21:29:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:29:16,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-01 21:29:16,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:29:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:29:16,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:29:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:29:17,297 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:29:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1941295105] [2024-11-01 21:29:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1941295105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:29:17,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:29:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-01 21:29:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340289475] [2024-11-01 21:29:17,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:29:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-01 21:29:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:29:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-01 21:29:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-01 21:29:17,299 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:29:17,533 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-01 21:29:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-01 21:29:17,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-01 21:29:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:29:17,534 INFO L225 Difference]: With dead ends: 17 [2024-11-01 21:29:17,534 INFO L226 Difference]: Without dead ends: 15 [2024-11-01 21:29:17,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-01 21:29:17,535 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 21:29:17,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 21:29:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-01 21:29:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-01 21:29:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-01 21:29:17,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-01 21:29:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:29:17,538 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-01 21:29:17,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:29:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-01 21:29:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-01 21:29:17,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:29:17,539 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-01 21:29:17,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-01 21:29:17,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:17,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:29:17,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:29:17,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-01 21:29:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:29:17,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491231619] [2024-11-01 21:29:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:29:17,742 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:29:17,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:17,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:29:17,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-01 21:29:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 21:29:17,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-01 21:29:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 21:29:17,989 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-01 21:29:17,989 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-01 21:29:17,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 21:29:17,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Ended with exit code 0 [2024-11-01 21:29:18,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:18,194 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-01 21:29:18,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 21:29:18,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 09:29:18 BoogieIcfgContainer [2024-11-01 21:29:18,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 21:29:18,237 INFO L158 Benchmark]: Toolchain (without parser) took 4681.99ms. Allocated memory was 231.7MB in the beginning and 357.6MB in the end (delta: 125.8MB). Free memory was 208.4MB in the beginning and 291.9MB in the end (delta: -83.5MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2024-11-01 21:29:18,237 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 231.7MB. Free memory is still 208.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 21:29:18,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.17ms. Allocated memory is still 231.7MB. Free memory was 208.3MB in the beginning and 190.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-01 21:29:18,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.71ms. Allocated memory is still 231.7MB. Free memory was 190.5MB in the beginning and 187.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-01 21:29:18,237 INFO L158 Benchmark]: Boogie Preprocessor took 59.97ms. Allocated memory is still 231.7MB. Free memory was 187.9MB in the beginning and 184.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-01 21:29:18,238 INFO L158 Benchmark]: RCFGBuilder took 407.77ms. Allocated memory is still 231.7MB. Free memory was 184.7MB in the beginning and 159.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-11-01 21:29:18,238 INFO L158 Benchmark]: TraceAbstraction took 3883.82ms. Allocated memory was 231.7MB in the beginning and 357.6MB in the end (delta: 125.8MB). Free memory was 158.5MB in the beginning and 291.9MB in the end (delta: -133.4MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 21:29:18,239 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 231.7MB. Free memory is still 208.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.17ms. Allocated memory is still 231.7MB. Free memory was 208.3MB in the beginning and 190.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.71ms. Allocated memory is still 231.7MB. Free memory was 190.5MB in the beginning and 187.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.97ms. Allocated memory is still 231.7MB. Free memory was 187.9MB in the beginning and 184.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 407.77ms. Allocated memory is still 231.7MB. Free memory was 184.7MB in the beginning and 159.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3883.82ms. Allocated memory was 231.7MB in the beginning and 357.6MB in the end (delta: 125.8MB). Free memory was 158.5MB in the beginning and 291.9MB in the end (delta: -133.4MB). There was no memory consumed. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 13 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 11 QuantifiedInterpolants, 1899 SizeOfPredicates, 12 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/18 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 proved your program to be incorrect! [2024-11-01 21:29:18,271 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...