/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 'cvc5 --incremental --print-success --lang smt' -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-b75d321-m [2024-11-05 03:40:46,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 03:40:46,236 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-05 03:40:46,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 03:40:46,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 03:40:46,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 03:40:46,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 03:40:46,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 03:40:46,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 03:40:46,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 03:40:46,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 03:40:46,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 03:40:46,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 03:40:46,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 03:40:46,275 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 03:40:46,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 03:40:46,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 03:40:46,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 03:40:46,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 03:40:46,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 03:40:46,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 03:40:46,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 03:40:46,279 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 03:40:46,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 03:40:46,279 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 03:40:46,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 03:40:46,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 03:40:46,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 03:40:46,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 03:40:46,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 03:40:46,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 03:40:46,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 03:40:46,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 03:40:46,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 03:40:46,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 03:40:46,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 03:40:46,282 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 03:40:46,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 03:40:46,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 03:40:46,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 03:40:46,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 03:40:46,284 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 -> cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:46,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 03:40:46,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 03:40:46,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 03:40:46,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 03:40:46,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 03:40:46,541 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-05 03:40:48,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 03:40:48,209 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 03:40:48,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-05 03:40:48,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a3a2b2e/1a166130a4c84d0cb9f2cb73f8f6aba5/FLAG266f3d179 [2024-11-05 03:40:48,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a3a2b2e/1a166130a4c84d0cb9f2cb73f8f6aba5 [2024-11-05 03:40:48,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 03:40:48,234 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 03:40:48,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 03:40:48,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 03:40:48,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 03:40:48,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c91d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48, skipping insertion in model container [2024-11-05 03:40:48,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 03:40:48,427 WARN L250 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-05 03:40:48,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 03:40:48,460 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 03:40:48,470 WARN L250 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-05 03:40:48,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 03:40:48,498 INFO L204 MainTranslator]: Completed translation [2024-11-05 03:40:48,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48 WrapperNode [2024-11-05 03:40:48,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 03:40:48,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 03:40:48,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 03:40:48,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 03:40:48,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,527 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-05 03:40:48,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 03:40:48,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 03:40:48,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 03:40:48,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 03:40:48,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,549 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-05 03:40:48,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 03:40:48,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 03:40:48,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 03:40:48,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 03:40:48,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (1/1) ... [2024-11-05 03:40:48,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 03:40:48,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 03:40:48,611 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-05 03:40:48,615 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-05 03:40:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 03:40:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 03:40:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 03:40:48,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 03:40:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 03:40:48,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 03:40:48,734 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 03:40:48,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 03:40:48,875 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-05 03:40:48,875 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 03:40:48,886 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 03:40:48,886 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 03:40:48,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 03:40:48 BoogieIcfgContainer [2024-11-05 03:40:48,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 03:40:48,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 03:40:48,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 03:40:48,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 03:40:48,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 03:40:48" (1/3) ... [2024-11-05 03:40:48,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5f8dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 03:40:48, skipping insertion in model container [2024-11-05 03:40:48,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 03:40:48" (2/3) ... [2024-11-05 03:40:48,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5f8dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 03:40:48, skipping insertion in model container [2024-11-05 03:40:48,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 03:40:48" (3/3) ... [2024-11-05 03:40:48,895 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-11-05 03:40:48,918 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 03:40:48,918 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 03:40:48,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 03:40:48,990 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;@580f3c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 03:40:48,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 03:40:48,995 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-05 03:40:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-05 03:40:49,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:40:49,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-05 03:40:49,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:40:49,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:40:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1806460890, now seen corresponding path program 1 times [2024-11-05 03:40:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:40:49,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171600881] [2024-11-05 03:40:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:40:49,023 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:49,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:40:49,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:40:49,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-05 03:40:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:40:49,134 WARN L253 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-05 03:40:49,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:40:49,329 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-05 03:40:49,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:40:49,420 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-05 03:40:49,421 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:40:49,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171600881] [2024-11-05 03:40:49,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [171600881] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 03:40:49,422 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 03:40:49,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-05 03:40:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608474132] [2024-11-05 03:40:49,425 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 03:40:49,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 03:40:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:40:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 03:40:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-05 03:40:49,458 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-05 03:40:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:40:49,579 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-05 03:40:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 03:40:49,583 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-05 03:40:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:40:49,590 INFO L225 Difference]: With dead ends: 36 [2024-11-05 03:40:49,591 INFO L226 Difference]: Without dead ends: 22 [2024-11-05 03:40:49,594 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-05 03:40:49,600 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-05 03:40:49,601 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-05 03:40:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-05 03:40:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-05 03:40:49,634 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-05 03:40:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-05 03:40:49,638 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2024-11-05 03:40:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:40:49,639 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-05 03:40:49,639 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-05 03:40:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-05 03:40:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-05 03:40:49,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:40:49,640 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 03:40:49,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-05 03:40:49,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:49,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:40:49,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:40:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash -361639814, now seen corresponding path program 1 times [2024-11-05 03:40:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:40:49,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1024502094] [2024-11-05 03:40:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:40:49,843 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:49,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:40:49,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:40:49,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-05 03:40:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:40:49,911 WARN L253 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-05 03:40:49,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:40:50,115 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-05 03:40:50,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:40:50,305 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-05 03:40:50,305 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:40:50,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1024502094] [2024-11-05 03:40:50,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1024502094] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 03:40:50,306 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 03:40:50,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 11 [2024-11-05 03:40:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456704042] [2024-11-05 03:40:50,306 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 03:40:50,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 03:40:50,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:40:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 03:40:50,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-05 03:40:50,312 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-05 03:40:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:40:50,459 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-05 03:40:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 03:40:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-05 03:40:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:40:50,462 INFO L225 Difference]: With dead ends: 28 [2024-11-05 03:40:50,462 INFO L226 Difference]: Without dead ends: 26 [2024-11-05 03:40:50,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-05 03:40:50,464 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 03:40:50,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 03:40:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-05 03:40:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-05 03:40:50,475 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-05 03:40:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-05 03:40:50,476 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2024-11-05 03:40:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:40:50,477 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-05 03:40:50,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-05 03:40:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-05 03:40:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-05 03:40:50,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:40:50,479 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 03:40:50,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-05 03:40:50,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:50,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:40:50,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:40:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2143106440, now seen corresponding path program 1 times [2024-11-05 03:40:50,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:40:50,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105669818] [2024-11-05 03:40:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:40:50,683 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:40:50,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:40:50,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-05 03:40:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:40:50,750 WARN L253 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-05 03:40:50,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:40:51,080 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-05 03:40:51,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:40:51,197 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-05 03:40:51,198 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:40:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105669818] [2024-11-05 03:40:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [105669818] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:40:51,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:40:51,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-05 03:40:51,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416209998] [2024-11-05 03:40:51,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:40:51,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 03:40:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:40:51,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 03:40:51,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-05 03:40:51,200 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-05 03:40:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:40:51,459 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-05 03:40:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 03:40:51,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2024-11-05 03:40:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:40:51,461 INFO L225 Difference]: With dead ends: 47 [2024-11-05 03:40:51,461 INFO L226 Difference]: Without dead ends: 45 [2024-11-05 03:40:51,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-11-05 03:40:51,463 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 03:40:51,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 03:40:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-05 03:40:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-05 03:40:51,478 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-05 03:40:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-05 03:40:51,481 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2024-11-05 03:40:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:40:51,481 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-05 03:40:51,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-05 03:40:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-05 03:40:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 03:40:51,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:40:51,482 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-05 03:40:51,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-05 03:40:51,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:51,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:40:51,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:40:51,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2135901336, now seen corresponding path program 2 times [2024-11-05 03:40:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:40:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1075764781] [2024-11-05 03:40:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:40:51,685 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:51,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:40:51,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:40:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-05 03:40:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:40:51,751 WARN L253 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-05 03:40:51,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:40:52,055 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-05 03:40:52,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:40:52,267 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-05 03:40:52,268 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:40:52,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1075764781] [2024-11-05 03:40:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1075764781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:40:52,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:40:52,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2024-11-05 03:40:52,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855600316] [2024-11-05 03:40:52,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:40:52,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 03:40:52,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:40:52,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 03:40:52,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-05 03:40:52,272 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-05 03:40:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:40:52,546 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-05 03:40:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 03:40:52,547 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2024-11-05 03:40:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:40:52,548 INFO L225 Difference]: With dead ends: 55 [2024-11-05 03:40:52,548 INFO L226 Difference]: Without dead ends: 53 [2024-11-05 03:40:52,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-11-05 03:40:52,549 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 03:40:52,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 82 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 03:40:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-05 03:40:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-11-05 03:40:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 03:40:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-11-05 03:40:52,561 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 26 [2024-11-05 03:40:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:40:52,561 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-11-05 03:40:52,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-05 03:40:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-05 03:40:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-05 03:40:52,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:40:52,563 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-05 03:40:52,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-05 03:40:52,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:52,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:40:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:40:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1952471386, now seen corresponding path program 3 times [2024-11-05 03:40:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:40:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1581042166] [2024-11-05 03:40:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:40:52,766 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:52,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:40:52,767 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:40:52,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-05 03:40:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:40:52,854 WARN L253 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-05 03:40:52,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:40:53,728 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-05 03:40:53,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:40:54,142 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-05 03:40:54,143 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:40:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1581042166] [2024-11-05 03:40:54,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1581042166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:40:54,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:40:54,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 26 [2024-11-05 03:40:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168629591] [2024-11-05 03:40:54,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:40:54,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-05 03:40:54,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:40:54,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-05 03:40:54,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2024-11-05 03:40:54,145 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 26 states, 17 states have (on average 2.176470588235294) internal successors, (37), 23 states have internal predecessors, (37), 13 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-05 03:40:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:40:54,881 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-05 03:40:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-05 03:40:54,882 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 17 states have (on average 2.176470588235294) internal successors, (37), 23 states have internal predecessors, (37), 13 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16) Word has length 59 [2024-11-05 03:40:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:40:54,883 INFO L225 Difference]: With dead ends: 84 [2024-11-05 03:40:54,883 INFO L226 Difference]: Without dead ends: 82 [2024-11-05 03:40:54,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2024-11-05 03:40:54,885 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 03:40:54,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 183 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 03:40:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-05 03:40:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-05 03:40:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 53 states have internal predecessors, (53), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-05 03:40:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2024-11-05 03:40:54,902 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 59 [2024-11-05 03:40:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:40:54,902 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2024-11-05 03:40:54,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 17 states have (on average 2.176470588235294) internal successors, (37), 23 states have internal predecessors, (37), 13 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-05 03:40:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2024-11-05 03:40:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-05 03:40:54,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:40:54,904 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2024-11-05 03:40:54,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-05 03:40:55,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:55,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:40:55,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:40:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1848991238, now seen corresponding path program 4 times [2024-11-05 03:40:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:40:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832738964] [2024-11-05 03:40:55,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:40:55,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:55,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:40:55,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:40:55,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-05 03:40:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:40:55,220 WARN L253 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-05 03:40:55,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:40:56,041 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-05 03:40:56,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:40:56,530 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-05 03:40:56,531 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:40:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832738964] [2024-11-05 03:40:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1832738964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:40:56,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:40:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 27 [2024-11-05 03:40:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747191148] [2024-11-05 03:40:56,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:40:56,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-05 03:40:56,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:40:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-05 03:40:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2024-11-05 03:40:56,534 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 27 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 24 states have internal predecessors, (39), 15 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 10 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-05 03:40:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:40:57,372 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-11-05 03:40:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-05 03:40:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 24 states have internal predecessors, (39), 15 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 10 states have call predecessors, (18), 14 states have call successors, (18) Word has length 65 [2024-11-05 03:40:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:40:57,374 INFO L225 Difference]: With dead ends: 97 [2024-11-05 03:40:57,374 INFO L226 Difference]: Without dead ends: 95 [2024-11-05 03:40:57,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=421, Invalid=1385, Unknown=0, NotChecked=0, Total=1806 [2024-11-05 03:40:57,376 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 03:40:57,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 170 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 03:40:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-05 03:40:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-05 03:40:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 63 states have internal predecessors, (63), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-05 03:40:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2024-11-05 03:40:57,395 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 65 [2024-11-05 03:40:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:40:57,396 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2024-11-05 03:40:57,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 24 states have internal predecessors, (39), 15 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 10 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-05 03:40:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2024-11-05 03:40:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 03:40:57,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:40:57,398 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2024-11-05 03:40:57,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-05 03:40:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:57,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:40:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:40:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash 683247480, now seen corresponding path program 5 times [2024-11-05 03:40:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:40:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [816615432] [2024-11-05 03:40:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:40:57,603 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:40:57,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:40:57,605 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:40:57,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-05 03:40:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:40:57,746 WARN L253 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 189 conjuncts are in the unsatisfiable core [2024-11-05 03:40:57,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:40:59,216 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-05 03:40:59,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:41:00,045 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-05 03:41:00,045 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:41:00,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [816615432] [2024-11-05 03:41:00,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [816615432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:41:00,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:41:00,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15] total 46 [2024-11-05 03:41:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590160237] [2024-11-05 03:41:00,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:41:00,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-05 03:41:00,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:41:00,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-05 03:41:00,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1678, Unknown=0, NotChecked=0, Total=2070 [2024-11-05 03:41:00,049 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 46 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 43 states have internal predecessors, (67), 28 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 19 states have call predecessors, (36), 27 states have call successors, (36) [2024-11-05 03:41:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:41:02,158 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2024-11-05 03:41:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-05 03:41:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 43 states have internal predecessors, (67), 28 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 19 states have call predecessors, (36), 27 states have call successors, (36) Word has length 124 [2024-11-05 03:41:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:41:02,161 INFO L225 Difference]: With dead ends: 155 [2024-11-05 03:41:02,161 INFO L226 Difference]: Without dead ends: 153 [2024-11-05 03:41:02,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1200, Invalid=4500, Unknown=0, NotChecked=0, Total=5700 [2024-11-05 03:41:02,164 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 03:41:02,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 331 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 03:41:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-05 03:41:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2024-11-05 03:41:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 98 states have internal predecessors, (98), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-05 03:41:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2024-11-05 03:41:02,198 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 124 [2024-11-05 03:41:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:41:02,199 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2024-11-05 03:41:02,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 43 states have internal predecessors, (67), 28 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 19 states have call predecessors, (36), 27 states have call successors, (36) [2024-11-05 03:41:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2024-11-05 03:41:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-05 03:41:02,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:41:02,202 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2024-11-05 03:41:02,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-05 03:41:02,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:41:02,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:41:02,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:41:02,405 INFO L85 PathProgramCache]: Analyzing trace with hash 335156282, now seen corresponding path program 6 times [2024-11-05 03:41:02,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:41:02,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2011102819] [2024-11-05 03:41:02,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:41:02,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:41:02,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:41:02,407 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:41:02,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-05 03:41:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 03:41:02,574 WARN L253 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 219 conjuncts are in the unsatisfiable core [2024-11-05 03:41:02,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 03:41:04,206 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-05 03:41:04,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 03:41:05,596 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-05 03:41:05,596 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 03:41:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2011102819] [2024-11-05 03:41:05,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2011102819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 03:41:05,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 03:41:05,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 16] total 51 [2024-11-05 03:41:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244924443] [2024-11-05 03:41:05,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 03:41:05,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-05 03:41:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 03:41:05,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-05 03:41:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2054, Unknown=0, NotChecked=0, Total=2550 [2024-11-05 03:41:05,599 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 51 states, 29 states have (on average 2.586206896551724) internal successors, (75), 48 states have internal predecessors, (75), 33 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 22 states have call predecessors, (42), 32 states have call successors, (42) [2024-11-05 03:41:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 03:41:09,528 INFO L93 Difference]: Finished difference Result 173 states and 206 transitions. [2024-11-05 03:41:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-05 03:41:09,528 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 29 states have (on average 2.586206896551724) internal successors, (75), 48 states have internal predecessors, (75), 33 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 22 states have call predecessors, (42), 32 states have call successors, (42) Word has length 143 [2024-11-05 03:41:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 03:41:09,531 INFO L225 Difference]: With dead ends: 173 [2024-11-05 03:41:09,531 INFO L226 Difference]: Without dead ends: 171 [2024-11-05 03:41:09,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2587 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1726, Invalid=5414, Unknown=0, NotChecked=0, Total=7140 [2024-11-05 03:41:09,537 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 03:41:09,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 458 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 03:41:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-05 03:41:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-11-05 03:41:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 110 states have (on average 1.009090909090909) internal successors, (111), 111 states have internal predecessors, (111), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-05 03:41:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2024-11-05 03:41:09,604 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 143 [2024-11-05 03:41:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 03:41:09,604 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2024-11-05 03:41:09,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 29 states have (on average 2.586206896551724) internal successors, (75), 48 states have internal predecessors, (75), 33 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 22 states have call predecessors, (42), 32 states have call successors, (42) [2024-11-05 03:41:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2024-11-05 03:41:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-05 03:41:09,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 03:41:09,610 INFO L215 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2024-11-05 03:41:09,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-05 03:41:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:41:09,810 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 03:41:09,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 03:41:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1132989722, now seen corresponding path program 7 times [2024-11-05 03:41:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 03:41:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026236293] [2024-11-05 03:41:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 03:41:09,811 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-05 03:41:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-05 03:41:09,812 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 03:41:09,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-05 03:41:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 03:41:09,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 03:41:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 03:41:10,149 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 03:41:10,150 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 03:41:10,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 03:41:10,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-11-05 03:41:10,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-05 03:41:10,358 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-11-05 03:41:10,443 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 03:41:10,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 03:41:10 BoogieIcfgContainer [2024-11-05 03:41:10,447 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 03:41:10,448 INFO L158 Benchmark]: Toolchain (without parser) took 22213.70ms. Allocated memory was 295.7MB in the beginning and 512.8MB in the end (delta: 217.1MB). Free memory was 246.3MB in the beginning and 384.2MB in the end (delta: -137.9MB). Peak memory consumption was 80.1MB. Max. memory is 8.0GB. [2024-11-05 03:41:10,448 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 03:41:10,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.28ms. Allocated memory is still 295.7MB. Free memory was 246.3MB in the beginning and 232.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 03:41:10,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.87ms. Allocated memory is still 295.7MB. Free memory was 232.7MB in the beginning and 231.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-05 03:41:10,449 INFO L158 Benchmark]: Boogie Preprocessor took 33.22ms. Allocated memory is still 295.7MB. Free memory was 231.0MB in the beginning and 229.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 03:41:10,449 INFO L158 Benchmark]: RCFGBuilder took 323.87ms. Allocated memory is still 295.7MB. Free memory was 228.9MB in the beginning and 216.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-05 03:41:10,450 INFO L158 Benchmark]: TraceAbstraction took 21558.67ms. Allocated memory was 295.7MB in the beginning and 512.8MB in the end (delta: 217.1MB). Free memory was 215.9MB in the beginning and 384.2MB in the end (delta: -168.3MB). Peak memory consumption was 49.7MB. Max. memory is 8.0GB. [2024-11-05 03:41:10,452 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.12ms. Allocated memory is still 180.4MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.28ms. Allocated memory is still 295.7MB. Free memory was 246.3MB in the beginning and 232.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.87ms. Allocated memory is still 295.7MB. Free memory was 232.7MB in the beginning and 231.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.22ms. Allocated memory is still 295.7MB. Free memory was 231.0MB in the beginning and 229.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 323.87ms. Allocated memory is still 295.7MB. Free memory was 228.9MB in the beginning and 216.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21558.67ms. Allocated memory was 295.7MB in the beginning and 512.8MB in the end (delta: 217.1MB). Free memory was 215.9MB in the beginning and 384.2MB in the end (delta: -168.3MB). Peak memory consumption was 49.7MB. 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: 21.4s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 1427 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1309 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3551 IncrementalHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 118 mSDtfsCounter, 3551 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1011 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5623 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=8, InterpolantAutomatonStates: 206, 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, 9.6s InterpolantComputationTime, 646 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 898 ConstructedInterpolants, 0 QuantifiedInterpolants, 23065 SizeOfPredicates, 188 NumberOfNonLiveVariables, 1169 ConjunctsInSsa, 739 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-05 03:41:10,486 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...