/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.factorial4even.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 21:30:53,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 21:30:53,125 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:30:53,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 21:30:53,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 21:30:53,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 21:30:53,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 21:30:53,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 21:30:53,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 21:30:53,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 21:30:53,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 21:30:53,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 21:30:53,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 21:30:53,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 21:30:53,181 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 21:30:53,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 21:30:53,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 21:30:53,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 21:30:53,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 21:30:53,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 21:30:53,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 21:30:53,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 21:30:53,189 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 21:30:53,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 21:30:53,190 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 21:30:53,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 21:30:53,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 21:30:53,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 21:30:53,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 21:30:53,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 21:30:53,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 21:30:53,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 21:30:53,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 21:30:53,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 21:30:53,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 21:30:53,193 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 21:30:53,193 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 21:30:53,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 21:30:53,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 21:30:53,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 21:30:53,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 21:30:53,195 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 21:30:53,195 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:30:53,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 21:30:53,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 21:30:53,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 21:30:53,532 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 21:30:53,532 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 21:30:53,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-01 21:30:55,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 21:30:55,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 21:30:55,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-01 21:30:55,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418b6198d/62f92baa06814cefbad592030da50cf3/FLAG44aa25982 [2024-11-01 21:30:55,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418b6198d/62f92baa06814cefbad592030da50cf3 [2024-11-01 21:30:55,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 21:30:55,279 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 21:30:55,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 21:30:55,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 21:30:55,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 21:30:55,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b268889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55, skipping insertion in model container [2024-11-01 21:30:55,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 21:30:55,484 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.factorial4even.c[1439,1452] [2024-11-01 21:30:55,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 21:30:55,531 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 21:30:55,544 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.factorial4even.c[1439,1452] [2024-11-01 21:30:55,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 21:30:55,582 INFO L204 MainTranslator]: Completed translation [2024-11-01 21:30:55,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55 WrapperNode [2024-11-01 21:30:55,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 21:30:55,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 21:30:55,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 21:30:55,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 21:30:55,592 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:30:55" (1/1) ... [2024-11-01 21:30:55,599 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:30:55" (1/1) ... [2024-11-01 21:30:55,620 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-01 21:30:55,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 21:30:55,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 21:30:55,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 21:30:55,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 21:30:55,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,647 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:30:55,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 21:30:55,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 21:30:55,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 21:30:55,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 21:30:55,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (1/1) ... [2024-11-01 21:30:55,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 21:30:55,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 21:30:55,700 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:30:55,703 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:30:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 21:30:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 21:30:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 21:30:55,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 21:30:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-01 21:30:55,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-01 21:30:55,782 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 21:30:55,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 21:30:55,963 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-01 21:30:55,963 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 21:30:55,974 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 21:30:55,974 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 21:30:55,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:30:55 BoogieIcfgContainer [2024-11-01 21:30:55,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 21:30:55,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 21:30:55,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 21:30:55,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 21:30:55,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 09:30:55" (1/3) ... [2024-11-01 21:30:55,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fdeb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:30:55, skipping insertion in model container [2024-11-01 21:30:55,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:30:55" (2/3) ... [2024-11-01 21:30:55,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fdeb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:30:55, skipping insertion in model container [2024-11-01 21:30:55,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:30:55" (3/3) ... [2024-11-01 21:30:55,985 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-11-01 21:30:55,999 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 21:30:55,999 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 21:30:56,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 21:30:56,057 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;@676b6950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 21:30:56,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 21:30:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 21:30:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-01 21:30:56,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:30:56,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-01 21:30:56,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:30:56,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:30:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1806460890, now seen corresponding path program 1 times [2024-11-01 21:30:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:30:56,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165104115] [2024-11-01 21:30:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:30:56,087 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:30:56,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:56,090 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:30:56,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-01 21:30:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:30:56,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-01 21:30:56,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:30:56,326 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:30:56,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:30:56,408 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:30:56,409 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:30:56,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165104115] [2024-11-01 21:30:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [165104115] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 21:30:56,410 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 21:30:56,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-01 21:30:56,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51456318] [2024-11-01 21:30:56,413 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 21:30:56,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-01 21:30:56,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:30:56,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-01 21:30:56,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-01 21:30:56,442 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:30:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:30:56,576 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-01 21:30:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-01 21:30:56,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-01 21:30:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:30:56,585 INFO L225 Difference]: With dead ends: 36 [2024-11-01 21:30:56,585 INFO L226 Difference]: Without dead ends: 22 [2024-11-01 21:30:56,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-01 21:30:56,591 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 21:30:56,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 21:30:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-01 21:30:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-01 21:30:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-01 21:30:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-01 21:30:56,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2024-11-01 21:30:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:30:56,625 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-01 21:30:56,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 21:30:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-01 21:30:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-01 21:30:56,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:30:56,626 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 21:30:56,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Forceful destruction successful, exit code 0 [2024-11-01 21:30:56,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:56,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:30:56,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:30:56,828 INFO L85 PathProgramCache]: Analyzing trace with hash -361639814, now seen corresponding path program 1 times [2024-11-01 21:30:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:30:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [673457125] [2024-11-01 21:30:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:30:56,829 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:30:56,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:56,832 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:30:56,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-01 21:30:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:30:56,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-01 21:30:56,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:30:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:30:57,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:30:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:30:57,199 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:30:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [673457125] [2024-11-01 21:30:57,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [673457125] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 21:30:57,199 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 21:30:57,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-01 21:30:57,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482374187] [2024-11-01 21:30:57,201 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 21:30:57,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-01 21:30:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:30:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-01 21:30:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-01 21:30:57,204 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 21:30:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:30:57,299 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-01 21:30:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-01 21:30:57,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-11-01 21:30:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:30:57,301 INFO L225 Difference]: With dead ends: 28 [2024-11-01 21:30:57,301 INFO L226 Difference]: Without dead ends: 26 [2024-11-01 21:30:57,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-01 21:30:57,303 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 21:30:57,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 21:30:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-01 21:30:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-01 21:30:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-01 21:30:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-01 21:30:57,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2024-11-01 21:30:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:30:57,315 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-01 21:30:57,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 21:30:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-01 21:30:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-01 21:30:57,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:30:57,316 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 21:30:57,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-01 21:30:57,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:57,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:30:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:30:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2143106440, now seen corresponding path program 1 times [2024-11-01 21:30:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:30:57,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457196590] [2024-11-01 21:30:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:30:57,519 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:30:57,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:57,522 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:30:57,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-01 21:30:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:30:57,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-01 21:30:57,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:30:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-01 21:30:57,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:30:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-01 21:30:57,794 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:30:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1457196590] [2024-11-01 21:30:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1457196590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:30:57,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:30:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-01 21:30:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417610064] [2024-11-01 21:30:57,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:30:57,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-01 21:30:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:30:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-01 21:30:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-01 21:30:57,798 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-01 21:30:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:30:58,016 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-01 21:30:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-01 21:30:58,017 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-11-01 21:30:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:30:58,018 INFO L225 Difference]: With dead ends: 47 [2024-11-01 21:30:58,018 INFO L226 Difference]: Without dead ends: 45 [2024-11-01 21:30:58,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-01 21:30:58,020 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 21:30:58,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 74 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 21:30:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-01 21:30:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-01 21:30:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 21:30:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-01 21:30:58,031 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2024-11-01 21:30:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:30:58,031 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-01 21:30:58,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-01 21:30:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-01 21:30:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-01 21:30:58,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:30:58,033 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-01 21:30:58,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-01 21:30:58,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:58,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:30:58,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:30:58,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2135901336, now seen corresponding path program 2 times [2024-11-01 21:30:58,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:30:58,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [489483745] [2024-11-01 21:30:58,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:30:58,236 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:30:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:58,238 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:30:58,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-01 21:30:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:30:58,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-01 21:30:58,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:30:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-01 21:30:58,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:30:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-01 21:30:58,674 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:30:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [489483745] [2024-11-01 21:30:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [489483745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:30:58,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:30:58,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-01 21:30:58,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923371377] [2024-11-01 21:30:58,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:30:58,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-01 21:30:58,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:30:58,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-01 21:30:58,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-01 21:30:58,680 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-01 21:30:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:30:58,911 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-11-01 21:30:58,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-01 21:30:58,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2024-11-01 21:30:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:30:58,912 INFO L225 Difference]: With dead ends: 51 [2024-11-01 21:30:58,913 INFO L226 Difference]: Without dead ends: 49 [2024-11-01 21:30:58,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-01 21:30:58,914 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 21:30:58,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 21:30:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-01 21:30:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-01 21:30:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-01 21:30:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-11-01 21:30:58,927 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 26 [2024-11-01 21:30:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:30:58,927 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-11-01 21:30:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-01 21:30:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-11-01 21:30:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-01 21:30:58,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:30:58,932 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-01 21:30:58,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Ended with exit code 0 [2024-11-01 21:30:59,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:59,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:30:59,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:30:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1952471386, now seen corresponding path program 3 times [2024-11-01 21:30:59,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:30:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391903218] [2024-11-01 21:30:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:30:59,134 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:30:59,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:59,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:30:59,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Waiting until timeout for monitored process [2024-11-01 21:30:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:30:59,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-01 21:30:59,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:30:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-01 21:30:59,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:30:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-01 21:30:59,779 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:30:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391903218] [2024-11-01 21:30:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1391903218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:30:59,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:30:59,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-01 21:30:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113829796] [2024-11-01 21:30:59,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:30:59,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-01 21:30:59,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:30:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-01 21:30:59,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-01 21:30:59,782 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-01 21:31:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:31:00,411 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2024-11-01 21:31:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-01 21:31:00,412 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 59 [2024-11-01 21:31:00,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:31:00,414 INFO L225 Difference]: With dead ends: 80 [2024-11-01 21:31:00,414 INFO L226 Difference]: Without dead ends: 78 [2024-11-01 21:31:00,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2024-11-01 21:31:00,418 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-01 21:31:00,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 153 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-01 21:31:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-01 21:31:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-11-01 21:31:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-01 21:31:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2024-11-01 21:31:00,442 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 59 [2024-11-01 21:31:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:31:00,442 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2024-11-01 21:31:00,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-01 21:31:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2024-11-01 21:31:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-01 21:31:00,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:31:00,444 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2024-11-01 21:31:00,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Ended with exit code 0 [2024-11-01 21:31:00,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:00,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:31:00,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:31:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1848991238, now seen corresponding path program 4 times [2024-11-01 21:31:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:31:00,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911755559] [2024-11-01 21:31:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:31:00,646 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:31:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:00,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:31:00,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (7)] Waiting until timeout for monitored process [2024-11-01 21:31:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:31:00,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-01 21:31:00,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:31:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-01 21:31:01,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:31:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-01 21:31:01,681 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:31:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911755559] [2024-11-01 21:31:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [911755559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:31:01,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:31:01,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-01 21:31:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084819863] [2024-11-01 21:31:01,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:31:01,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-01 21:31:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:31:01,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-01 21:31:01,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-01 21:31:01,684 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 11 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-01 21:31:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:31:02,532 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2024-11-01 21:31:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-01 21:31:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 11 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 65 [2024-11-01 21:31:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:31:02,534 INFO L225 Difference]: With dead ends: 89 [2024-11-01 21:31:02,534 INFO L226 Difference]: Without dead ends: 87 [2024-11-01 21:31:02,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2024-11-01 21:31:02,535 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-01 21:31:02,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 175 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-01 21:31:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-01 21:31:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-01 21:31:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 57 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-01 21:31:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2024-11-01 21:31:02,555 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 65 [2024-11-01 21:31:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:31:02,556 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2024-11-01 21:31:02,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 11 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-01 21:31:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2024-11-01 21:31:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-01 21:31:02,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:31:02,558 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2024-11-01 21:31:02,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (7)] Ended with exit code 0 [2024-11-01 21:31:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:02,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:31:02,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:31:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash 683247480, now seen corresponding path program 5 times [2024-11-01 21:31:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:31:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1625480070] [2024-11-01 21:31:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:31:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:31:02,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:02,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:31:02,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (8)] Waiting until timeout for monitored process [2024-11-01 21:31:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:31:02,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-01 21:31:02,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:31:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-01 21:31:03,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:31:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-01 21:31:04,013 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:31:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1625480070] [2024-11-01 21:31:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1625480070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:31:04,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:31:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-11-01 21:31:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050191535] [2024-11-01 21:31:04,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:31:04,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-01 21:31:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:31:04,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-01 21:31:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2024-11-01 21:31:04,016 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-01 21:31:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:31:05,828 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2024-11-01 21:31:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-01 21:31:05,828 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 124 [2024-11-01 21:31:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:31:05,830 INFO L225 Difference]: With dead ends: 143 [2024-11-01 21:31:05,830 INFO L226 Difference]: Without dead ends: 141 [2024-11-01 21:31:05,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=715, Invalid=2477, Unknown=0, NotChecked=0, Total=3192 [2024-11-01 21:31:05,832 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-01 21:31:05,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 497 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-01 21:31:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-01 21:31:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-01 21:31:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 89 states have internal predecessors, (89), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-01 21:31:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2024-11-01 21:31:05,866 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 124 [2024-11-01 21:31:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:31:05,867 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2024-11-01 21:31:05,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-01 21:31:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2024-11-01 21:31:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-01 21:31:05,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:31:05,869 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2024-11-01 21:31:05,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (8)] Ended with exit code 0 [2024-11-01 21:31:06,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:06,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:31:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:31:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 335156282, now seen corresponding path program 6 times [2024-11-01 21:31:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:31:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618253433] [2024-11-01 21:31:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:31:06,073 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:31:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:06,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:31:06,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (9)] Waiting until timeout for monitored process [2024-11-01 21:31:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:31:06,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-01 21:31:06,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:31:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 42 proven. 265 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-01 21:31:07,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:31:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 42 proven. 265 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-01 21:31:08,236 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:31:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618253433] [2024-11-01 21:31:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1618253433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:31:08,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:31:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2024-11-01 21:31:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173960530] [2024-11-01 21:31:08,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:31:08,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-01 21:31:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:31:08,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-01 21:31:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2024-11-01 21:31:08,243 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 states have internal predecessors, (75), 23 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 22 states have call predecessors, (42), 22 states have call successors, (42) [2024-11-01 21:31:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:31:11,672 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2024-11-01 21:31:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-01 21:31:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 states have internal predecessors, (75), 23 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 22 states have call predecessors, (42), 22 states have call successors, (42) Word has length 143 [2024-11-01 21:31:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:31:11,675 INFO L225 Difference]: With dead ends: 157 [2024-11-01 21:31:11,675 INFO L226 Difference]: Without dead ends: 155 [2024-11-01 21:31:11,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1029, Invalid=2753, Unknown=0, NotChecked=0, Total=3782 [2024-11-01 21:31:11,677 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-01 21:31:11,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 612 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-01 21:31:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-01 21:31:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-01 21:31:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.010204081632653) internal successors, (99), 99 states have internal predecessors, (99), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-01 21:31:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2024-11-01 21:31:11,721 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 143 [2024-11-01 21:31:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:31:11,721 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2024-11-01 21:31:11,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 states have internal predecessors, (75), 23 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 22 states have call predecessors, (42), 22 states have call successors, (42) [2024-11-01 21:31:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2024-11-01 21:31:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-01 21:31:11,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:31:11,725 INFO L215 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2024-11-01 21:31:11,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (9)] Forceful destruction successful, exit code 0 [2024-11-01 21:31:11,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:11,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:31:11,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:31:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1132989722, now seen corresponding path program 7 times [2024-11-01 21:31:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:31:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [634373022] [2024-11-01 21:31:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:31:11,927 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:31:11,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:11,929 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:31:11,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (10)] Waiting until timeout for monitored process [2024-11-01 21:31:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 21:31:12,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-01 21:31:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 21:31:12,208 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-01 21:31:12,208 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-01 21:31:12,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 21:31:12,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (10)] Ended with exit code 0 [2024-11-01 21:31:12,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:31:12,414 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-11-01 21:31:12,492 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 21:31:12,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 09:31:12 BoogieIcfgContainer [2024-11-01 21:31:12,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 21:31:12,498 INFO L158 Benchmark]: Toolchain (without parser) took 17219.06ms. Allocated memory was 222.3MB in the beginning and 483.4MB in the end (delta: 261.1MB). Free memory was 197.4MB in the beginning and 333.3MB in the end (delta: -136.0MB). Peak memory consumption was 125.6MB. Max. memory is 8.0GB. [2024-11-01 21:31:12,498 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 222.3MB. Free memory was 198.6MB in the beginning and 198.6MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 21:31:12,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.66ms. Allocated memory is still 222.3MB. Free memory was 197.4MB in the beginning and 183.7MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-01 21:31:12,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.08ms. Allocated memory is still 222.3MB. Free memory was 183.7MB in the beginning and 182.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-01 21:31:12,499 INFO L158 Benchmark]: Boogie Preprocessor took 49.72ms. Allocated memory is still 222.3MB. Free memory was 182.2MB in the beginning and 180.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 21:31:12,499 INFO L158 Benchmark]: RCFGBuilder took 302.25ms. Allocated memory is still 222.3MB. Free memory was 180.1MB in the beginning and 168.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-01 21:31:12,499 INFO L158 Benchmark]: TraceAbstraction took 16519.78ms. Allocated memory was 222.3MB in the beginning and 483.4MB in the end (delta: 261.1MB). Free memory was 167.0MB in the beginning and 333.3MB in the end (delta: -166.4MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. [2024-11-01 21:31:12,501 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.13ms. Allocated memory is still 222.3MB. Free memory was 198.6MB in the beginning and 198.6MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.66ms. Allocated memory is still 222.3MB. Free memory was 197.4MB in the beginning and 183.7MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.08ms. Allocated memory is still 222.3MB. Free memory was 183.7MB in the beginning and 182.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.72ms. Allocated memory is still 222.3MB. Free memory was 182.2MB in the beginning and 180.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 302.25ms. Allocated memory is still 222.3MB. Free memory was 180.1MB in the beginning and 168.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16519.78ms. Allocated memory was 222.3MB in the beginning and 483.4MB in the end (delta: 261.1MB). Free memory was 167.0MB in the beginning and 333.3MB in the end (delta: -166.4MB). Peak memory consumption was 95.2MB. 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L34] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L35] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L37] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 1); [L38] const SORT_12 msb_SORT_12 = (SORT_12)1 << (1 - 1); [L40] const SORT_1 var_2 = 1; [L41] const SORT_1 var_11 = mask_SORT_1; [L42] const SORT_1 var_16 = 3; [L45] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 init_5_arg_1 = var_2; [L49] state_3 = init_5_arg_1 [L50] SORT_1 init_6_arg_1 = var_2; [L51] state_4 = init_6_arg_1 VAL [mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=1, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=15, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=0] [L29] COND TRUE !(cond) VAL [\old(cond)=0] [L29] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 1740 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1577 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2272 IncrementalHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 163 mSDtfsCounter, 2272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1007 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=8, InterpolantAutomatonStates: 173, 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, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 646 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 898 ConstructedInterpolants, 0 QuantifiedInterpolants, 22018 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1169 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 3696/4802 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:31:12,538 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...