/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 17:20:24,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 17:20:24,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-01 17:20:24,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 17:20:24,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 17:20:24,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 17:20:24,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 17:20:24,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 17:20:24,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 17:20:24,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 17:20:24,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 17:20:24,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 17:20:24,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 17:20:24,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 17:20:24,323 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 17:20:24,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 17:20:24,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 17:20:24,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 17:20:24,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 17:20:24,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 17:20:24,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 17:20:24,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 17:20:24,328 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 17:20:24,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 17:20:24,329 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 17:20:24,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 17:20:24,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 17:20:24,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 17:20:24,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 17:20:24,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 17:20:24,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 17:20:24,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 17:20:24,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 17:20:24,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 17:20:24,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 17:20:24,331 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 17:20:24,331 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 17:20:24,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 17:20:24,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 17:20:24,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 17:20:24,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 17:20:24,333 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 17:20:24,333 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:24,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 17:20:24,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 17:20:24,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 17:20:24,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 17:20:24,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 17:20:24,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-01 17:20:26,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 17:20:26,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 17:20:26,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-01 17:20:26,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1667f2b9/d4af0c6f7955429b88be1a0546e37df5/FLAG05237ee82 [2024-11-01 17:20:26,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1667f2b9/d4af0c6f7955429b88be1a0546e37df5 [2024-11-01 17:20:26,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 17:20:26,574 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 17:20:26,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 17:20:26,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 17:20:26,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 17:20:26,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485f3ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26, skipping insertion in model container [2024-11-01 17:20:26,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 17:20:26,728 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1439,1452] [2024-11-01 17:20:26,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 17:20:26,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 17:20:26,776 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1439,1452] [2024-11-01 17:20:26,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 17:20:26,804 INFO L204 MainTranslator]: Completed translation [2024-11-01 17:20:26,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26 WrapperNode [2024-11-01 17:20:26,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 17:20:26,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 17:20:26,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 17:20:26,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 17:20:26,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,835 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-01 17:20:26,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 17:20:26,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 17:20:26,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 17:20:26,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 17:20:26,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-01 17:20:26,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 17:20:26,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 17:20:26,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 17:20:26,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 17:20:26,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (1/1) ... [2024-11-01 17:20:26,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 17:20:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 17:20:26,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-01 17:20:26,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-01 17:20:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 17:20:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 17:20:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 17:20:26,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 17:20:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-01 17:20:26,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-01 17:20:26,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 17:20:27,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 17:20:27,170 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-01 17:20:27,171 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 17:20:27,180 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 17:20:27,180 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 17:20:27,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:20:27 BoogieIcfgContainer [2024-11-01 17:20:27,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 17:20:27,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 17:20:27,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 17:20:27,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 17:20:27,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 05:20:26" (1/3) ... [2024-11-01 17:20:27,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a56f161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:20:27, skipping insertion in model container [2024-11-01 17:20:27,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:20:26" (2/3) ... [2024-11-01 17:20:27,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a56f161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:20:27, skipping insertion in model container [2024-11-01 17:20:27,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:20:27" (3/3) ... [2024-11-01 17:20:27,189 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-11-01 17:20:27,200 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 17:20:27,200 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 17:20:27,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 17:20:27,242 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;@7326a37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 17:20:27,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 17:20:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 17:20:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-01 17:20:27,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:20:27,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-01 17:20:27,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:20:27,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:20:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1806460890, now seen corresponding path program 1 times [2024-11-01 17:20:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:20:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [560064474] [2024-11-01 17:20:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:20:27,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:27,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:20:27,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:20:27,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-01 17:20:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:20:27,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-01 17:20:27,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:20:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 17:20:27,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:20:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 17:20:27,500 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:20:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [560064474] [2024-11-01 17:20:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [560064474] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 17:20:27,501 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 17:20:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-01 17:20:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169652762] [2024-11-01 17:20:27,503 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 17:20:27,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-01 17:20:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:20:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-01 17:20:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-01 17:20:27,524 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 17:20:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:20:27,607 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-01 17:20:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-01 17:20:27,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-01 17:20:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:20:27,617 INFO L225 Difference]: With dead ends: 36 [2024-11-01 17:20:27,617 INFO L226 Difference]: Without dead ends: 22 [2024-11-01 17:20:27,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-01 17:20:27,623 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 17:20:27,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 17:20:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-01 17:20:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-01 17:20:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-01 17:20:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-01 17:20:27,649 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2024-11-01 17:20:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:20:27,649 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-01 17:20:27,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 17:20:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-01 17:20:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-01 17:20:27,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:20:27,650 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 17:20:27,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-01 17:20:27,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:27,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:20:27,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:20:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash -361639814, now seen corresponding path program 1 times [2024-11-01 17:20:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:20:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [991503747] [2024-11-01 17:20:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:20:27,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:20:27,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:20:27,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-01 17:20:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:20:27,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-01 17:20:27,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:20:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 17:20:27,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:20:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 17:20:28,092 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:20:28,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [991503747] [2024-11-01 17:20:28,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [991503747] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 17:20:28,095 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 17:20:28,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-01 17:20:28,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894380421] [2024-11-01 17:20:28,096 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 17:20:28,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-01 17:20:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:20:28,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-01 17:20:28,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-01 17:20:28,099 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 17:20:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:20:28,175 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-01 17:20:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-01 17:20:28,176 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-11-01 17:20:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:20:28,177 INFO L225 Difference]: With dead ends: 28 [2024-11-01 17:20:28,177 INFO L226 Difference]: Without dead ends: 26 [2024-11-01 17:20:28,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-01 17:20:28,178 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 17:20:28,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 17:20:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-01 17:20:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-01 17:20:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-01 17:20:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-01 17:20:28,188 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2024-11-01 17:20:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:20:28,188 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-01 17:20:28,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 17:20:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-01 17:20:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-01 17:20:28,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:20:28,189 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 17:20:28,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-01 17:20:28,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:28,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:20:28,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:20:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2143106440, now seen corresponding path program 1 times [2024-11-01 17:20:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:20:28,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95411972] [2024-11-01 17:20:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:20:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:20:28,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:20:28,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-01 17:20:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:20:28,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-01 17:20:28,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:20:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-01 17:20:28,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:20:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-01 17:20:28,721 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:20:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [95411972] [2024-11-01 17:20:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [95411972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 17:20:28,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 17:20:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-01 17:20:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094633594] [2024-11-01 17:20:28,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 17:20:28,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-01 17:20:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:20:28,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-01 17:20:28,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-01 17:20:28,727 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-01 17:20:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:20:28,924 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-01 17:20:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-01 17:20:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-11-01 17:20:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:20:28,926 INFO L225 Difference]: With dead ends: 47 [2024-11-01 17:20:28,926 INFO L226 Difference]: Without dead ends: 45 [2024-11-01 17:20:28,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-01 17:20:28,927 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 17:20:28,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 74 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 17:20:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-01 17:20:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-01 17:20:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 17:20:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-01 17:20:28,937 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2024-11-01 17:20:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:20:28,937 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-01 17:20:28,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-01 17:20:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-01 17:20:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-01 17:20:28,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:20:28,938 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-01 17:20:28,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-01 17:20:29,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:29,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:20:29,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:20:29,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2135901336, now seen corresponding path program 2 times [2024-11-01 17:20:29,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:20:29,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1202285387] [2024-11-01 17:20:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:20:29,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:29,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:20:29,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:20:29,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-01 17:20:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:20:29,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-01 17:20:29,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:20:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-01 17:20:29,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:20:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-01 17:20:29,415 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:20:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1202285387] [2024-11-01 17:20:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1202285387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 17:20:29,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 17:20:29,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-01 17:20:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386784937] [2024-11-01 17:20:29,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 17:20:29,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-01 17:20:29,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:20:29,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-01 17:20:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-01 17:20:29,417 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-01 17:20:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:20:29,585 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-11-01 17:20:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-01 17:20:29,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2024-11-01 17:20:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:20:29,592 INFO L225 Difference]: With dead ends: 48 [2024-11-01 17:20:29,592 INFO L226 Difference]: Without dead ends: 46 [2024-11-01 17:20:29,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-01 17:20:29,593 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 17:20:29,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 112 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 17:20:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-01 17:20:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-01 17:20:29,606 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-01 17:20:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-11-01 17:20:29,608 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 26 [2024-11-01 17:20:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:20:29,608 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-01 17:20:29,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-01 17:20:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-01 17:20:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-01 17:20:29,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:20:29,611 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2024-11-01 17:20:29,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-01 17:20:29,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:29,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:20:29,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:20:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash -291480616, now seen corresponding path program 3 times [2024-11-01 17:20:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:20:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1646076138] [2024-11-01 17:20:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:20:29,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:29,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:20:29,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:20:29,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-01 17:20:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:20:29,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-01 17:20:29,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:20:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-01 17:20:30,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:20:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-01 17:20:35,862 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:20:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1646076138] [2024-11-01 17:20:35,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1646076138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 17:20:35,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 17:20:35,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-11-01 17:20:35,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616119407] [2024-11-01 17:20:35,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 17:20:35,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-01 17:20:35,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:20:35,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-01 17:20:35,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=174, Unknown=1, NotChecked=0, Total=210 [2024-11-01 17:20:35,865 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-01 17:20:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:20:37,208 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-11-01 17:20:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-01 17:20:37,209 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 52 [2024-11-01 17:20:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:20:37,210 INFO L225 Difference]: With dead ends: 56 [2024-11-01 17:20:37,210 INFO L226 Difference]: Without dead ends: 54 [2024-11-01 17:20:37,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2024-11-01 17:20:37,211 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-01 17:20:37,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 162 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-01 17:20:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-01 17:20:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-01 17:20:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 17:20:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-11-01 17:20:37,220 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 52 [2024-11-01 17:20:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:20:37,220 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-01 17:20:37,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-01 17:20:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-11-01 17:20:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-01 17:20:37,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:20:37,221 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-01 17:20:37,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-01 17:20:37,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:37,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:20:37,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:20:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1952471386, now seen corresponding path program 4 times [2024-11-01 17:20:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:20:37,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [368006507] [2024-11-01 17:20:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:20:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:20:37,425 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:20:37,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-01 17:20:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:20:37,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-01 17:20:37,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:20:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-01 17:20:39,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:20:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-01 17:20:41,161 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:20:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [368006507] [2024-11-01 17:20:41,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [368006507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 17:20:41,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 17:20:41,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-01 17:20:41,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489272748] [2024-11-01 17:20:41,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 17:20:41,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-01 17:20:41,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:20:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-01 17:20:41,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-01 17:20:41,164 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-01 17:20:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:20:44,959 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-11-01 17:20:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-01 17:20:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 59 [2024-11-01 17:20:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:20:44,961 INFO L225 Difference]: With dead ends: 88 [2024-11-01 17:20:44,961 INFO L226 Difference]: Without dead ends: 86 [2024-11-01 17:20:44,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2024-11-01 17:20:44,962 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-01 17:20:44,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 178 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-01 17:20:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-01 17:20:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-01 17:20:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-01 17:20:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2024-11-01 17:20:44,975 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 59 [2024-11-01 17:20:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:20:44,975 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2024-11-01 17:20:44,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-01 17:20:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2024-11-01 17:20:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-01 17:20:44,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:20:44,978 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2024-11-01 17:20:44,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-01 17:20:45,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:45,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:20:45,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:20:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash 683247480, now seen corresponding path program 5 times [2024-11-01 17:20:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:20:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [828606827] [2024-11-01 17:20:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:20:45,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:20:45,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:20:45,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:20:45,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-01 17:20:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:20:45,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-01 17:20:45,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:20:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-01 17:20:49,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:20:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-01 17:20:53,791 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:20:53,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [828606827] [2024-11-01 17:20:53,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [828606827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 17:20:53,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 17:20:53,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-11-01 17:20:53,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46040699] [2024-11-01 17:20:53,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 17:20:53,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-01 17:20:53,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:20:53,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-01 17:20:53,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2024-11-01 17:20:53,798 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-01 17:21:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:21:05,598 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2024-11-01 17:21:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-01 17:21:05,599 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 124 [2024-11-01 17:21:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:21:05,600 INFO L225 Difference]: With dead ends: 147 [2024-11-01 17:21:05,600 INFO L226 Difference]: Without dead ends: 145 [2024-11-01 17:21:05,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=715, Invalid=2477, Unknown=0, NotChecked=0, Total=3192 [2024-11-01 17:21:05,602 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-01 17:21:05,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 391 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-01 17:21:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-01 17:21:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-11-01 17:21:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.010989010989011) internal successors, (92), 92 states have internal predecessors, (92), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-01 17:21:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2024-11-01 17:21:05,627 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 124 [2024-11-01 17:21:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:21:05,627 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2024-11-01 17:21:05,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-01 17:21:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2024-11-01 17:21:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-01 17:21:05,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:21:05,630 INFO L215 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2024-11-01 17:21:05,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-01 17:21:05,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:21:05,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:21:05,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:21:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1132989722, now seen corresponding path program 6 times [2024-11-01 17:21:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:21:05,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [121081743] [2024-11-01 17:21:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:21:05,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:21:05,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:21:05,834 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:21:05,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-01 17:21:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 17:21:06,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-01 17:21:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 17:21:06,278 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-01 17:21:06,278 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-01 17:21:06,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 17:21:06,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-01 17:21:06,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:21:06,483 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2024-11-01 17:21:06,548 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 17:21:06,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 05:21:06 BoogieIcfgContainer [2024-11-01 17:21:06,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 17:21:06,553 INFO L158 Benchmark]: Toolchain (without parser) took 39979.35ms. Allocated memory was 229.6MB in the beginning and 297.8MB in the end (delta: 68.2MB). Free memory was 205.3MB in the beginning and 247.5MB in the end (delta: -42.2MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. [2024-11-01 17:21:06,553 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 229.6MB. Free memory is still 205.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 17:21:06,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.09ms. Allocated memory is still 229.6MB. Free memory was 205.3MB in the beginning and 191.4MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-01 17:21:06,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.20ms. Allocated memory is still 229.6MB. Free memory was 191.4MB in the beginning and 189.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 17:21:06,554 INFO L158 Benchmark]: Boogie Preprocessor took 44.56ms. Allocated memory is still 229.6MB. Free memory was 189.8MB in the beginning and 187.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 17:21:06,554 INFO L158 Benchmark]: RCFGBuilder took 299.91ms. Allocated memory is still 229.6MB. Free memory was 187.7MB in the beginning and 174.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-01 17:21:06,558 INFO L158 Benchmark]: TraceAbstraction took 39368.60ms. Allocated memory was 229.6MB in the beginning and 297.8MB in the end (delta: 68.2MB). Free memory was 173.6MB in the beginning and 247.5MB in the end (delta: -73.9MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 17:21:06,559 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 229.6MB. Free memory is still 205.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.09ms. Allocated memory is still 229.6MB. Free memory was 205.3MB in the beginning and 191.4MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.20ms. Allocated memory is still 229.6MB. Free memory was 191.4MB in the beginning and 189.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.56ms. Allocated memory is still 229.6MB. Free memory was 189.8MB in the beginning and 187.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 299.91ms. Allocated memory is still 229.6MB. Free memory was 187.7MB in the beginning and 174.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 39368.60ms. Allocated memory was 229.6MB in the beginning and 297.8MB in the end (delta: 68.2MB). Free memory was 173.6MB in the beginning and 247.5MB in the end (delta: -73.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 39.3s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 1034 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 915 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1279 IncrementalHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 119 mSDtfsCounter, 1279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=7, InterpolantAutomatonStates: 107, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 588 ConstructedInterpolants, 43 QuantifiedInterpolants, 5802 SizeOfPredicates, 39 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 1807/2342 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-01 17:21:06,779 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-01 17:21:06,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...