/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy FOX -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-17387ad-m [2024-11-06 15:29:31,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 15:29:31,871 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-06 15:29:31,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 15:29:31,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 15:29:31,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 15:29:31,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 15:29:31,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 15:29:31,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 15:29:31,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 15:29:31,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 15:29:31,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 15:29:31,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 15:29:31,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 15:29:31,915 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 15:29:31,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 15:29:31,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 15:29:31,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 15:29:31,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 15:29:31,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 15:29:31,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 15:29:31,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 15:29:31,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 15:29:31,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 15:29:31,922 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 15:29:31,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 15:29:31,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 15:29:31,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 15:29:31,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 15:29:31,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 15:29:31,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 15:29:31,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 15:29:31,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 15:29:31,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 15:29:31,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 15:29:31,925 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 15:29:31,925 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 15:29:31,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 15:29:31,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 15:29:31,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 15:29:31,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 15:29:31,927 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FOX [2024-11-06 15:29:32,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 15:29:32,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 15:29:32,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 15:29:32,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 15:29:32,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 15:29:32,180 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-06 15:29:33,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 15:29:33,795 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 15:29:33,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-06 15:29:33,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb760905c/cc00c9c70c714585b51896f138e75468/FLAGd328201a2 [2024-11-06 15:29:34,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb760905c/cc00c9c70c714585b51896f138e75468 [2024-11-06 15:29:34,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 15:29:34,177 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 15:29:34,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 15:29:34,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 15:29:34,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 15:29:34,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76abe55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34, skipping insertion in model container [2024-11-06 15:29:34,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 15:29:34,366 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-06 15:29:34,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 15:29:34,398 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 15:29:34,408 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-06 15:29:34,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 15:29:34,434 INFO L204 MainTranslator]: Completed translation [2024-11-06 15:29:34,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34 WrapperNode [2024-11-06 15:29:34,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 15:29:34,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 15:29:34,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 15:29:34,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 15:29:34,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,466 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-06 15:29:34,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 15:29:34,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 15:29:34,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 15:29:34,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 15:29:34,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,486 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-06 15:29:34,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 15:29:34,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 15:29:34,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 15:29:34,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 15:29:34,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (1/1) ... [2024-11-06 15:29:34,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 15:29:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:34,528 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-06 15:29:34,530 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-06 15:29:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 15:29:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 15:29:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 15:29:34,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 15:29:34,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 15:29:34,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 15:29:34,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 15:29:34,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 15:29:34,771 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-06 15:29:34,771 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 15:29:34,786 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 15:29:34,786 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 15:29:34,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:29:34 BoogieIcfgContainer [2024-11-06 15:29:34,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 15:29:34,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 15:29:34,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 15:29:34,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 15:29:34,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 03:29:34" (1/3) ... [2024-11-06 15:29:34,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc13a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:29:34, skipping insertion in model container [2024-11-06 15:29:34,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:29:34" (2/3) ... [2024-11-06 15:29:34,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc13a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:29:34, skipping insertion in model container [2024-11-06 15:29:34,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:29:34" (3/3) ... [2024-11-06 15:29:34,793 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-11-06 15:29:34,805 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 15:29:34,805 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 15:29:34,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 15:29:34,854 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;@57e81d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 15:29:34,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 15:29:34,858 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-06 15:29:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-06 15:29:34,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 15:29:34,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-06 15:29:34,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 15:29:34,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 15:29:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1806460890, now seen corresponding path program 1 times [2024-11-06 15:29:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 15:29:34,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963275239] [2024-11-06 15:29:34,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 15:29:34,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:34,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:34,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 15:29:34,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 15:29:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 15:29:34,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 15:29:34,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:35,109 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-06 15:29:35,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 15:29:35,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 15:29:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963275239] [2024-11-06 15:29:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963275239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 15:29:35,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 15:29:35,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 15:29:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809887642] [2024-11-06 15:29:35,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 15:29:35,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 15:29:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 15:29:35,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 15:29:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 15:29:35,137 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 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 15:29:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 15:29:35,242 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-06 15:29:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 15:29:35,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-06 15:29:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 15:29:35,252 INFO L225 Difference]: With dead ends: 36 [2024-11-06 15:29:35,252 INFO L226 Difference]: Without dead ends: 22 [2024-11-06 15:29:35,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 15:29:35,257 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 15:29:35,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 15:29:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-06 15:29:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-06 15:29:35,285 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-06 15:29:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-06 15:29:35,287 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2024-11-06 15:29:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 15:29:35,287 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-06 15:29:35,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 15:29:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-06 15:29:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-06 15:29:35,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 15:29:35,289 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 15:29:35,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 15:29:35,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:35,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 15:29:35,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 15:29:35,491 INFO L85 PathProgramCache]: Analyzing trace with hash -361639814, now seen corresponding path program 1 times [2024-11-06 15:29:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 15:29:35,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046373889] [2024-11-06 15:29:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 15:29:35,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:35,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:35,494 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 15:29:35,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 15:29:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 15:29:35,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 15:29:35,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 15:29:35,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 15:29:35,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 15:29:35,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046373889] [2024-11-06 15:29:35,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046373889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 15:29:35,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [652998904] [2024-11-06 15:29:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 15:29:35,877 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 15:29:35,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 15:29:35,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 15:29:35,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-06 15:29:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 15:29:35,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 15:29:35,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:36,036 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-06 15:29:36,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 15:29:36,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [652998904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 15:29:36,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 15:29:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2024-11-06 15:29:36,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679225513] [2024-11-06 15:29:36,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 15:29:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 15:29:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 15:29:36,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 15:29:36,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-06 15:29:36,041 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 15:29:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 15:29:36,118 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-06 15:29:36,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 15:29:36,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-06 15:29:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 15:29:36,120 INFO L225 Difference]: With dead ends: 28 [2024-11-06 15:29:36,120 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 15:29:36,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-06 15:29:36,124 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 15:29:36,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 15:29:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 15:29:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-06 15:29:36,132 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-06 15:29:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-06 15:29:36,134 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2024-11-06 15:29:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 15:29:36,134 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-06 15:29:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 15:29:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-06 15:29:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 15:29:36,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 15:29:36,136 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 15:29:36,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 15:29:36,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-06 15:29:36,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-06 15:29:36,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 15:29:36,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 15:29:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2143106440, now seen corresponding path program 1 times [2024-11-06 15:29:36,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 15:29:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194410914] [2024-11-06 15:29:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 15:29:36,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:36,545 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 15:29:36,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 15:29:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 15:29:36,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-06 15:29:36,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 15:29:36,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 15:29:36,900 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-06 15:29:36,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 15:29:36,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194410914] [2024-11-06 15:29:36,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194410914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 15:29:36,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 15:29:36,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-06 15:29:36,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027841507] [2024-11-06 15:29:36,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 15:29:36,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 15:29:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 15:29:36,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 15:29:36,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-06 15:29:36,905 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 15:29:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 15:29:37,174 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-06 15:29:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 15:29:37,174 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-11-06 15:29:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 15:29:37,175 INFO L225 Difference]: With dead ends: 47 [2024-11-06 15:29:37,175 INFO L226 Difference]: Without dead ends: 45 [2024-11-06 15:29:37,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-06 15:29:37,177 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 15:29:37,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 55 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 15:29:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-06 15:29:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-06 15:29:37,188 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-06 15:29:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-06 15:29:37,189 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2024-11-06 15:29:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 15:29:37,190 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-06 15:29:37,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 15:29:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-06 15:29:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 15:29:37,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 15:29:37,191 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-06 15:29:37,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-06 15:29:37,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:37,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 15:29:37,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 15:29:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2135901336, now seen corresponding path program 2 times [2024-11-06 15:29:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 15:29:37,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472189703] [2024-11-06 15:29:37,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 15:29:37,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:37,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:37,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 15:29:37,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 15:29:37,463 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 15:29:37,463 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 15:29:37,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 15:29:37,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 15:29:37,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 15:29:37,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 15:29:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472189703] [2024-11-06 15:29:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472189703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 15:29:37,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [720671670] [2024-11-06 15:29:37,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 15:29:37,716 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 15:29:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 15:29:37,719 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 15:29:37,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-06 15:29:37,810 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 15:29:37,810 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 15:29:37,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-06 15:29:37,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:37,917 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-06 15:29:37,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 15:29:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [720671670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 15:29:37,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 15:29:37,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2024-11-06 15:29:37,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253120121] [2024-11-06 15:29:37,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 15:29:37,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 15:29:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 15:29:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 15:29:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-06 15:29:37,965 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 15:29:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 15:29:38,103 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-11-06 15:29:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 15:29:38,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-06 15:29:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 15:29:38,106 INFO L225 Difference]: With dead ends: 48 [2024-11-06 15:29:38,106 INFO L226 Difference]: Without dead ends: 46 [2024-11-06 15:29:38,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-06 15:29:38,109 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 15:29:38,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 15:29:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-06 15:29:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-06 15:29:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-06 15:29:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-11-06 15:29:38,120 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 26 [2024-11-06 15:29:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 15:29:38,120 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-06 15:29:38,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 15:29:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-06 15:29:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 15:29:38,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 15:29:38,121 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-06 15:29:38,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 15:29:38,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-06 15:29:38,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-06 15:29:38,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 15:29:38,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 15:29:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1894510906, now seen corresponding path program 3 times [2024-11-06 15:29:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 15:29:38,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1630412376] [2024-11-06 15:29:38,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 15:29:38,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:38,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 15:29:38,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 15:29:38,594 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-06 15:29:38,594 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 15:29:38,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 15:29:38,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-06 15:29:38,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 15:29:38,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 15:29:38,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630412376] [2024-11-06 15:29:38,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630412376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 15:29:38,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1112303071] [2024-11-06 15:29:38,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 15:29:38,858 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 15:29:38,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 15:29:38,860 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 15:29:38,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-06 15:29:38,982 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-06 15:29:38,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 15:29:38,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 15:29:38,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 15:29:39,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 15:29:39,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1112303071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 15:29:39,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 15:29:39,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2024-11-06 15:29:39,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591611073] [2024-11-06 15:29:39,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 15:29:39,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 15:29:39,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 15:29:39,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 15:29:39,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-06 15:29:39,135 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 15:29:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 15:29:39,471 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-11-06 15:29:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 15:29:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-11-06 15:29:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 15:29:39,473 INFO L225 Difference]: With dead ends: 52 [2024-11-06 15:29:39,473 INFO L226 Difference]: Without dead ends: 50 [2024-11-06 15:29:39,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-06 15:29:39,474 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 15:29:39,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 81 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 15:29:39,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-06 15:29:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-06 15:29:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-06 15:29:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-06 15:29:39,485 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 39 [2024-11-06 15:29:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 15:29:39,485 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-06 15:29:39,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 15:29:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-11-06 15:29:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-06 15:29:39,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 15:29:39,487 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-06 15:29:39,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-06 15:29:39,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-06 15:29:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:39,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 15:29:39,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 15:29:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1952471386, now seen corresponding path program 4 times [2024-11-06 15:29:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 15:29:39,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429644486] [2024-11-06 15:29:39,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 15:29:39,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:39,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:39,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 15:29:39,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 15:29:39,973 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 15:29:39,973 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 15:29:39,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 15:29:39,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-06 15:29:40,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 15:29:40,562 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-06 15:29:40,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 15:29:40,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429644486] [2024-11-06 15:29:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429644486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 15:29:40,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 15:29:40,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-11-06 15:29:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847145540] [2024-11-06 15:29:40,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 15:29:40,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-06 15:29:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 15:29:40,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-06 15:29:40,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-06 15:29:40,564 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-06 15:29:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 15:29:41,220 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-06 15:29:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-06 15:29:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 59 [2024-11-06 15:29:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 15:29:41,222 INFO L225 Difference]: With dead ends: 84 [2024-11-06 15:29:41,222 INFO L226 Difference]: Without dead ends: 82 [2024-11-06 15:29:41,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2024-11-06 15:29:41,223 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 15:29:41,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 154 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 15:29:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-06 15:29:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-06 15:29:41,244 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-06 15:29:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2024-11-06 15:29:41,249 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 59 [2024-11-06 15:29:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 15:29:41,249 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2024-11-06 15:29:41,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-06 15:29:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2024-11-06 15:29:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-06 15:29:41,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 15:29:41,252 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2024-11-06 15:29:41,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-06 15:29:41,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:41,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 15:29:41,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 15:29:41,454 INFO L85 PathProgramCache]: Analyzing trace with hash 683247480, now seen corresponding path program 5 times [2024-11-06 15:29:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 15:29:41,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077819383] [2024-11-06 15:29:41,455 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-06 15:29:41,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:41,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:41,457 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 15:29:41,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-06 15:29:41,652 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-11-06 15:29:41,652 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 15:29:41,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-06 15:29:41,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 15:29:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 41 proven. 244 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-06 15:29:42,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 15:29:43,048 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-06 15:29:43,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 15:29:43,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077819383] [2024-11-06 15:29:43,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077819383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 15:29:43,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 15:29:43,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2024-11-06 15:29:43,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242131804] [2024-11-06 15:29:43,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 15:29:43,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-06 15:29:43,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 15:29:43,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-06 15:29:43,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2024-11-06 15:29:43,052 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-06 15:29:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 15:29:45,138 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2024-11-06 15:29:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-06 15:29:45,138 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 124 [2024-11-06 15:29:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 15:29:45,140 INFO L225 Difference]: With dead ends: 143 [2024-11-06 15:29:45,140 INFO L226 Difference]: Without dead ends: 141 [2024-11-06 15:29:45,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=736, Invalid=2686, Unknown=0, NotChecked=0, Total=3422 [2024-11-06 15:29:45,143 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 15:29:45,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 359 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 15:29:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-06 15:29:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-06 15:29:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 89 states have internal predecessors, (89), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-06 15:29:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2024-11-06 15:29:45,194 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 124 [2024-11-06 15:29:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 15:29:45,195 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2024-11-06 15:29:45,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-06 15:29:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2024-11-06 15:29:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-06 15:29:45,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 15:29:45,198 INFO L215 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2024-11-06 15:29:45,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-06 15:29:45,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:45,403 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 15:29:45,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 15:29:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1132989722, now seen corresponding path program 6 times [2024-11-06 15:29:45,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 15:29:45,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806252727] [2024-11-06 15:29:45,404 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-06 15:29:45,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:45,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 15:29:45,405 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 15:29:45,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-06 15:29:45,600 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2024-11-06 15:29:45,600 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 15:29:45,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 15:29:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 15:29:45,764 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-06 15:29:45,764 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 15:29:45,765 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 15:29:45,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-06 15:29:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 15:29:45,969 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2024-11-06 15:29:46,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 15:29:46,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 03:29:46 BoogieIcfgContainer [2024-11-06 15:29:46,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 15:29:46,051 INFO L158 Benchmark]: Toolchain (without parser) took 11873.34ms. Allocated memory was 205.5MB in the beginning and 335.5MB in the end (delta: 130.0MB). Free memory was 159.8MB in the beginning and 112.5MB in the end (delta: 47.3MB). Peak memory consumption was 178.0MB. Max. memory is 8.0GB. [2024-11-06 15:29:46,051 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 15:29:46,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.98ms. Allocated memory is still 205.5MB. Free memory was 159.5MB in the beginning and 146.2MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-06 15:29:46,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.14ms. Allocated memory is still 205.5MB. Free memory was 145.9MB in the beginning and 144.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 15:29:46,051 INFO L158 Benchmark]: Boogie Preprocessor took 30.28ms. Allocated memory is still 205.5MB. Free memory was 144.4MB in the beginning and 142.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 15:29:46,052 INFO L158 Benchmark]: RCFGBuilder took 288.37ms. Allocated memory is still 205.5MB. Free memory was 142.3MB in the beginning and 130.1MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-06 15:29:46,052 INFO L158 Benchmark]: TraceAbstraction took 11261.65ms. Allocated memory was 205.5MB in the beginning and 335.5MB in the end (delta: 130.0MB). Free memory was 129.4MB in the beginning and 112.5MB in the end (delta: 16.9MB). Peak memory consumption was 147.6MB. Max. memory is 8.0GB. [2024-11-06 15:29:46,053 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 205.5MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.98ms. Allocated memory is still 205.5MB. Free memory was 159.5MB in the beginning and 146.2MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.14ms. Allocated memory is still 205.5MB. Free memory was 145.9MB in the beginning and 144.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.28ms. Allocated memory is still 205.5MB. Free memory was 144.4MB in the beginning and 142.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 288.37ms. Allocated memory is still 205.5MB. Free memory was 142.3MB in the beginning and 130.1MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11261.65ms. Allocated memory was 205.5MB in the beginning and 335.5MB in the end (delta: 130.0MB). Free memory was 129.4MB in the beginning and 112.5MB in the end (delta: 16.9MB). Peak memory consumption was 147.6MB. 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: 11.1s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 794 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 706 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1514 IncrementalHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 88 mSDtfsCounter, 1514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 498 SyntacticMatches, 4 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=7, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 555 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 556 ConstructedInterpolants, 17 QuantifiedInterpolants, 5292 SizeOfPredicates, 61 NumberOfNonLiveVariables, 974 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 1627/2218 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-06 15:29:46,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...