/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-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 08:58:58,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 08:58:58,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 08:58:58,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 08:58:58,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 08:58:58,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 08:58:58,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 08:58:58,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 08:58:58,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 08:58:58,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 08:58:58,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 08:58:58,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 08:58:58,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 08:58:58,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 08:58:58,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 08:58:58,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 08:58:58,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 08:58:58,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 08:58:58,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 08:58:58,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 08:58:58,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 08:58:58,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 08:58:58,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 08:58:58,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 08:58:58,953 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 08:58:58,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 08:58:58,954 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 08:58:58,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 08:58:58,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 08:58:58,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 08:58:58,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 08:58:58,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 08:58:58,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 08:58:58,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 08:58:58,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:58:58,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 08:58:58,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 08:58:58,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 08:58:58,959 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 08:58:58,959 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 08:58:58,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 08:58:58,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 08:58:58,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 08:58:58,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 08:58:58,961 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-03 08:58:59,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 08:58:59,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 08:58:59,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 08:58:59,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 08:58:59,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 08:58:59,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add-1.i [2024-11-03 08:59:00,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 08:59:00,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 08:59:00,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i [2024-11-03 08:59:00,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fac8534f/18c6a9e438a846268454348321a11790/FLAGd761f3702 [2024-11-03 08:59:00,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fac8534f/18c6a9e438a846268454348321a11790 [2024-11-03 08:59:00,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 08:59:00,953 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 08:59:00,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 08:59:00,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 08:59:00,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 08:59:00,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:59:00" (1/1) ... [2024-11-03 08:59:00,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e460105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:00, skipping insertion in model container [2024-11-03 08:59:00,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:59:00" (1/1) ... [2024-11-03 08:59:00,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 08:59:01,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2024-11-03 08:59:01,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:59:01,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 08:59:01,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2024-11-03 08:59:01,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:59:01,259 INFO L204 MainTranslator]: Completed translation [2024-11-03 08:59:01,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01 WrapperNode [2024-11-03 08:59:01,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 08:59:01,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 08:59:01,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 08:59:01,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 08:59:01,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,306 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2024-11-03 08:59:01,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 08:59:01,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 08:59:01,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 08:59:01,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 08:59:01,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,341 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-03 08:59:01,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 08:59:01,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 08:59:01,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 08:59:01,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 08:59:01,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:59:01,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 08:59:01,394 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-03 08:59:01,397 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-03 08:59:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 08:59:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 08:59:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 08:59:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 08:59:01,515 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 08:59:01,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 08:59:01,921 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-03 08:59:01,922 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 08:59:01,939 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 08:59:01,939 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-03 08:59:01,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:59:01 BoogieIcfgContainer [2024-11-03 08:59:01,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 08:59:01,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 08:59:01,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 08:59:01,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 08:59:01,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 08:59:00" (1/3) ... [2024-11-03 08:59:01,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f36be8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:59:01, skipping insertion in model container [2024-11-03 08:59:01,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (2/3) ... [2024-11-03 08:59:01,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f36be8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:59:01, skipping insertion in model container [2024-11-03 08:59:01,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:59:01" (3/3) ... [2024-11-03 08:59:01,955 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2024-11-03 08:59:01,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 08:59:01,974 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 08:59:02,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 08:59:02,058 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;@408e74ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 08:59:02,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 08:59:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-03 08:59:02,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:02,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:02,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:02,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-03 08:59:02,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910558111] [2024-11-03 08:59:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:02,091 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-03 08:59:02,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:02,095 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-03 08:59:02,097 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-03 08:59:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:02,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 08:59:02,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:02,205 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-03 08:59:02,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:02,211 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-03 08:59:02,212 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:02,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910558111] [2024-11-03 08:59:02,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [910558111] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:02,213 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:02,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 08:59:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241168104] [2024-11-03 08:59:02,217 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:02,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 08:59:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:02,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 08:59:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:59:02,250 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:02,268 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-03 08:59:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 08:59:02,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-03 08:59:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:02,281 INFO L225 Difference]: With dead ends: 57 [2024-11-03 08:59:02,281 INFO L226 Difference]: Without dead ends: 38 [2024-11-03 08:59:02,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:59:02,290 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:02,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 08:59:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-03 08:59:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-03 08:59:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-03 08:59:02,331 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-03 08:59:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:02,332 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-03 08:59:02,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-03 08:59:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-03 08:59:02,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:02,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:02,341 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-03 08:59:02,536 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-03 08:59:02,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:02,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-03 08:59:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:02,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1479361016] [2024-11-03 08:59:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:02,538 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-03 08:59:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:02,542 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-03 08:59:02,543 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-03 08:59:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:02,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:59:02,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:02,674 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-03 08:59:02,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:02,712 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-03 08:59:02,713 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1479361016] [2024-11-03 08:59:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1479361016] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:02,714 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:02,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 08:59:02,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122097658] [2024-11-03 08:59:02,717 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:02,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 08:59:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 08:59:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-03 08:59:02,720 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:03,106 INFO L93 Difference]: Finished difference Result 141 states and 255 transitions. [2024-11-03 08:59:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 08:59:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-03 08:59:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:03,109 INFO L225 Difference]: With dead ends: 141 [2024-11-03 08:59:03,109 INFO L226 Difference]: Without dead ends: 113 [2024-11-03 08:59:03,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:59:03,114 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 154 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:03,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 150 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-03 08:59:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-03 08:59:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2024-11-03 08:59:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.67) internal successors, (167), 100 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 167 transitions. [2024-11-03 08:59:03,132 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 167 transitions. Word has length 12 [2024-11-03 08:59:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:03,132 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 167 transitions. [2024-11-03 08:59:03,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 167 transitions. [2024-11-03 08:59:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-03 08:59:03,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:03,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:03,139 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 (3)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:03,337 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-03 08:59:03,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:03,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2024-11-03 08:59:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:03,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747372327] [2024-11-03 08:59:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:03,339 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-03 08:59:03,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:03,343 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-03 08:59:03,345 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-03 08:59:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:03,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 08:59:03,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:03,484 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-03 08:59:03,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:03,558 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-03 08:59:03,558 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:03,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747372327] [2024-11-03 08:59:03,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [747372327] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:03,559 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:03,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2024-11-03 08:59:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030067244] [2024-11-03 08:59:03,559 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:03,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 08:59:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:03,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 08:59:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:59:03,561 INFO L87 Difference]: Start difference. First operand 101 states and 167 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:04,126 INFO L93 Difference]: Finished difference Result 274 states and 490 transitions. [2024-11-03 08:59:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 08:59:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-03 08:59:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:04,128 INFO L225 Difference]: With dead ends: 274 [2024-11-03 08:59:04,129 INFO L226 Difference]: Without dead ends: 229 [2024-11-03 08:59:04,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-03 08:59:04,131 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 793 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:04,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 169 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 08:59:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-03 08:59:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 190. [2024-11-03 08:59:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.656084656084656) internal successors, (313), 189 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 313 transitions. [2024-11-03 08:59:04,162 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 313 transitions. Word has length 14 [2024-11-03 08:59:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:04,162 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 313 transitions. [2024-11-03 08:59:04,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 313 transitions. [2024-11-03 08:59:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 08:59:04,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:04,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:04,169 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-03 08:59:04,365 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-03 08:59:04,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:04,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash -842586557, now seen corresponding path program 1 times [2024-11-03 08:59:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:04,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570058534] [2024-11-03 08:59:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:04,367 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-03 08:59:04,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:04,371 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-03 08:59:04,373 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-03 08:59:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:04,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:59:04,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:04,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:04,496 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:04,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1570058534] [2024-11-03 08:59:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1570058534] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:04,497 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:04,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 08:59:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103127857] [2024-11-03 08:59:04,500 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:04,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 08:59:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 08:59:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-03 08:59:04,502 INFO L87 Difference]: Start difference. First operand 190 states and 313 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:04,729 INFO L93 Difference]: Finished difference Result 833 states and 1392 transitions. [2024-11-03 08:59:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 08:59:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-03 08:59:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:04,733 INFO L225 Difference]: With dead ends: 833 [2024-11-03 08:59:04,733 INFO L226 Difference]: Without dead ends: 668 [2024-11-03 08:59:04,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:59:04,736 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 215 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:04,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 127 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 08:59:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-03 08:59:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 419. [2024-11-03 08:59:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.5406698564593302) internal successors, (644), 418 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 644 transitions. [2024-11-03 08:59:04,785 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 644 transitions. Word has length 26 [2024-11-03 08:59:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:04,785 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 644 transitions. [2024-11-03 08:59:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 644 transitions. [2024-11-03 08:59:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-03 08:59:04,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:04,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:04,793 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-03 08:59:04,992 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-03 08:59:04,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:04,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1924928046, now seen corresponding path program 1 times [2024-11-03 08:59:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:04,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356392018] [2024-11-03 08:59:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:04,994 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-03 08:59:04,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:04,996 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-03 08:59:04,998 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-03 08:59:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:05,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 08:59:05,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:05,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:05,331 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:05,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356392018] [2024-11-03 08:59:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [356392018] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:05,331 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2024-11-03 08:59:05,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996517833] [2024-11-03 08:59:05,332 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:05,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-03 08:59:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:05,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-03 08:59:05,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-03 08:59:05,334 INFO L87 Difference]: Start difference. First operand 419 states and 644 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:05,857 INFO L93 Difference]: Finished difference Result 1252 states and 1984 transitions. [2024-11-03 08:59:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-03 08:59:05,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-03 08:59:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:05,862 INFO L225 Difference]: With dead ends: 1252 [2024-11-03 08:59:05,862 INFO L226 Difference]: Without dead ends: 858 [2024-11-03 08:59:05,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-03 08:59:05,865 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 670 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:05,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 350 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 08:59:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2024-11-03 08:59:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 434. [2024-11-03 08:59:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.4942263279445727) internal successors, (647), 433 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 647 transitions. [2024-11-03 08:59:05,892 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 647 transitions. Word has length 28 [2024-11-03 08:59:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:05,893 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 647 transitions. [2024-11-03 08:59:05,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 647 transitions. [2024-11-03 08:59:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-03 08:59:05,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:05,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:05,902 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 (6)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:06,097 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-03 08:59:06,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:06,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1604924270, now seen corresponding path program 1 times [2024-11-03 08:59:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:06,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [642869138] [2024-11-03 08:59:06,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:06,100 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-03 08:59:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:06,101 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-03 08:59:06,102 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-03 08:59:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:06,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 08:59:06,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:06,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:06,290 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [642869138] [2024-11-03 08:59:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [642869138] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:06,290 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:06,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2024-11-03 08:59:06,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236069675] [2024-11-03 08:59:06,291 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:06,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-03 08:59:06,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-03 08:59:06,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-03 08:59:06,293 INFO L87 Difference]: Start difference. First operand 434 states and 647 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:06,798 INFO L93 Difference]: Finished difference Result 1149 states and 1796 transitions. [2024-11-03 08:59:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-03 08:59:06,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-03 08:59:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:06,803 INFO L225 Difference]: With dead ends: 1149 [2024-11-03 08:59:06,803 INFO L226 Difference]: Without dead ends: 962 [2024-11-03 08:59:06,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-03 08:59:06,807 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 565 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:06,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 405 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 08:59:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-03 08:59:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 829. [2024-11-03 08:59:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.4516908212560387) internal successors, (1202), 828 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1202 transitions. [2024-11-03 08:59:06,852 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1202 transitions. Word has length 28 [2024-11-03 08:59:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:06,852 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1202 transitions. [2024-11-03 08:59:06,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1202 transitions. [2024-11-03 08:59:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-03 08:59:06,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:06,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:06,865 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 (7)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:07,063 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-03 08:59:07,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:07,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:07,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1970910225, now seen corresponding path program 1 times [2024-11-03 08:59:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:07,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1805230421] [2024-11-03 08:59:07,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:07,065 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-03 08:59:07,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:07,067 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-03 08:59:07,068 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-03 08:59:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:07,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 08:59:07,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:07,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:07,174 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1805230421] [2024-11-03 08:59:07,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1805230421] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:07,174 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:07,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 08:59:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642255622] [2024-11-03 08:59:07,175 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:07,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 08:59:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 08:59:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:59:07,176 INFO L87 Difference]: Start difference. First operand 829 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:07,327 INFO L93 Difference]: Finished difference Result 1774 states and 2591 transitions. [2024-11-03 08:59:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 08:59:07,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-03 08:59:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:07,332 INFO L225 Difference]: With dead ends: 1774 [2024-11-03 08:59:07,332 INFO L226 Difference]: Without dead ends: 1056 [2024-11-03 08:59:07,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:59:07,335 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:07,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 82 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:59:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-03 08:59:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 966. [2024-11-03 08:59:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.38860103626943) internal successors, (1340), 965 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1340 transitions. [2024-11-03 08:59:07,376 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1340 transitions. Word has length 31 [2024-11-03 08:59:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:07,377 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1340 transitions. [2024-11-03 08:59:07,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1340 transitions. [2024-11-03 08:59:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-03 08:59:07,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:07,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:07,385 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 (8)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:07,580 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-03 08:59:07,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:07,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2075339537, now seen corresponding path program 1 times [2024-11-03 08:59:07,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:07,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1308611036] [2024-11-03 08:59:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:07,582 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-03 08:59:07,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:07,585 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-03 08:59:07,586 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-03 08:59:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:07,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 08:59:07,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:07,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:07,664 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:07,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1308611036] [2024-11-03 08:59:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1308611036] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:07,665 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:07,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 08:59:07,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472287367] [2024-11-03 08:59:07,665 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:07,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 08:59:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 08:59:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:59:07,666 INFO L87 Difference]: Start difference. First operand 966 states and 1340 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:07,706 INFO L93 Difference]: Finished difference Result 1291 states and 1768 transitions. [2024-11-03 08:59:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 08:59:07,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-03 08:59:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:07,713 INFO L225 Difference]: With dead ends: 1291 [2024-11-03 08:59:07,713 INFO L226 Difference]: Without dead ends: 1275 [2024-11-03 08:59:07,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:59:07,715 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:07,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 180 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 08:59:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2024-11-03 08:59:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1205. [2024-11-03 08:59:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.3770764119601329) internal successors, (1658), 1204 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1658 transitions. [2024-11-03 08:59:07,763 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1658 transitions. Word has length 31 [2024-11-03 08:59:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:07,765 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1658 transitions. [2024-11-03 08:59:07,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1658 transitions. [2024-11-03 08:59:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-03 08:59:07,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:07,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:07,771 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 (9)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:07,970 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-03 08:59:07,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:07,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1961462321, now seen corresponding path program 1 times [2024-11-03 08:59:07,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:07,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [61703344] [2024-11-03 08:59:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:07,971 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-03 08:59:07,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:07,972 INFO L229 MonitoredProcess]: Starting monitored process 10 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-03 08:59:07,973 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 (10)] Waiting until timeout for monitored process [2024-11-03 08:59:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:08,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 08:59:08,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:08,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:08,231 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:08,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [61703344] [2024-11-03 08:59:08,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [61703344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:59:08,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:59:08,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 08:59:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776060603] [2024-11-03 08:59:08,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:59:08,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 08:59:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:08,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 08:59:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:59:08,233 INFO L87 Difference]: Start difference. First operand 1205 states and 1658 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:08,850 INFO L93 Difference]: Finished difference Result 2859 states and 3977 transitions. [2024-11-03 08:59:08,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-03 08:59:08,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-03 08:59:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:08,857 INFO L225 Difference]: With dead ends: 2859 [2024-11-03 08:59:08,857 INFO L226 Difference]: Without dead ends: 2061 [2024-11-03 08:59:08,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2024-11-03 08:59:08,859 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 560 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:08,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 197 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 08:59:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2024-11-03 08:59:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1690. [2024-11-03 08:59:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 1.384251036116045) internal successors, (2338), 1689 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2338 transitions. [2024-11-03 08:59:08,920 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2338 transitions. Word has length 31 [2024-11-03 08:59:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:08,921 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2338 transitions. [2024-11-03 08:59:08,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2338 transitions. [2024-11-03 08:59:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-03 08:59:08,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:08,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:08,927 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 (10)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-03 08:59:09,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:09,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1135027793, now seen corresponding path program 1 times [2024-11-03 08:59:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [510462213] [2024-11-03 08:59:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:09,127 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-03 08:59:09,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:09,130 INFO L229 MonitoredProcess]: Starting monitored process 11 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-03 08:59:09,131 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 (11)] Waiting until timeout for monitored process [2024-11-03 08:59:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:09,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 08:59:09,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:09,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:09,318 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:09,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [510462213] [2024-11-03 08:59:09,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [510462213] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 08:59:09,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 08:59:09,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-03 08:59:09,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805655915] [2024-11-03 08:59:09,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:09,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 08:59:09,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:09,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 08:59:09,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:59:09,320 INFO L87 Difference]: Start difference. First operand 1690 states and 2338 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:09,529 INFO L93 Difference]: Finished difference Result 2186 states and 3036 transitions. [2024-11-03 08:59:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 08:59:09,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-03 08:59:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:09,536 INFO L225 Difference]: With dead ends: 2186 [2024-11-03 08:59:09,536 INFO L226 Difference]: Without dead ends: 1723 [2024-11-03 08:59:09,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:59:09,538 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 92 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:09,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 227 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 08:59:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2024-11-03 08:59:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1699. [2024-11-03 08:59:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.3657243816254416) internal successors, (2319), 1698 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2319 transitions. [2024-11-03 08:59:09,597 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2319 transitions. Word has length 32 [2024-11-03 08:59:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:09,597 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2319 transitions. [2024-11-03 08:59:09,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2319 transitions. [2024-11-03 08:59:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-03 08:59:09,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:09,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:09,602 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 (11)] Ended with exit code 0 [2024-11-03 08:59:09,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-03 08:59:09,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:09,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2055171256, now seen corresponding path program 1 times [2024-11-03 08:59:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:09,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [802385566] [2024-11-03 08:59:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:09,801 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-03 08:59:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:09,804 INFO L229 MonitoredProcess]: Starting monitored process 12 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-03 08:59:09,804 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 (12)] Waiting until timeout for monitored process [2024-11-03 08:59:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:09,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:59:09,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:09,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:09,938 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:09,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [802385566] [2024-11-03 08:59:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [802385566] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:09,939 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:09,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 08:59:09,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763249337] [2024-11-03 08:59:09,939 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:09,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 08:59:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:09,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 08:59:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-03 08:59:09,940 INFO L87 Difference]: Start difference. First operand 1699 states and 2319 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:10,229 INFO L93 Difference]: Finished difference Result 4415 states and 6250 transitions. [2024-11-03 08:59:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 08:59:10,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-03 08:59:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:10,242 INFO L225 Difference]: With dead ends: 4415 [2024-11-03 08:59:10,242 INFO L226 Difference]: Without dead ends: 3007 [2024-11-03 08:59:10,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:59:10,245 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 185 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:10,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 67 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 08:59:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-11-03 08:59:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2669. [2024-11-03 08:59:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 1.3875562218890554) internal successors, (3702), 2668 states have internal predecessors, (3702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3702 transitions. [2024-11-03 08:59:10,371 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3702 transitions. Word has length 33 [2024-11-03 08:59:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 3702 transitions. [2024-11-03 08:59:10,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3702 transitions. [2024-11-03 08:59:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-03 08:59:10,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:10,375 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:10,379 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 (12)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:10,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-03 08:59:10,576 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:10,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2024-11-03 08:59:10,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:10,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [935315335] [2024-11-03 08:59:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:10,577 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-03 08:59:10,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:10,580 INFO L229 MonitoredProcess]: Starting monitored process 13 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-03 08:59:10,581 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 (13)] Waiting until timeout for monitored process [2024-11-03 08:59:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:10,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-03 08:59:10,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-03 08:59:12,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-03 08:59:14,095 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [935315335] [2024-11-03 08:59:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [935315335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:59:14,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:59:14,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2024-11-03 08:59:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740048107] [2024-11-03 08:59:14,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:59:14,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-03 08:59:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:14,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-03 08:59:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2024-11-03 08:59:14,098 INFO L87 Difference]: Start difference. First operand 2669 states and 3702 transitions. Second operand has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:21,303 INFO L93 Difference]: Finished difference Result 4517 states and 6242 transitions. [2024-11-03 08:59:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-03 08:59:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-03 08:59:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:21,314 INFO L225 Difference]: With dead ends: 4517 [2024-11-03 08:59:21,314 INFO L226 Difference]: Without dead ends: 4203 [2024-11-03 08:59:21,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1921, Invalid=5911, Unknown=0, NotChecked=0, Total=7832 [2024-11-03 08:59:21,317 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 1529 mSDsluCounter, 5866 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 6232 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:21,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 6232 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-03 08:59:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2024-11-03 08:59:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3228. [2024-11-03 08:59:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 3227 states have (on average 1.3796095444685466) internal successors, (4452), 3227 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 4452 transitions. [2024-11-03 08:59:21,502 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 4452 transitions. Word has length 51 [2024-11-03 08:59:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:21,503 INFO L471 AbstractCegarLoop]: Abstraction has 3228 states and 4452 transitions. [2024-11-03 08:59:21,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 4452 transitions. [2024-11-03 08:59:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-03 08:59:21,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:21,506 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:21,509 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 (13)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:21,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-03 08:59:21,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash -65466659, now seen corresponding path program 1 times [2024-11-03 08:59:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:21,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476133283] [2024-11-03 08:59:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:21,710 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-03 08:59:21,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:21,711 INFO L229 MonitoredProcess]: Starting monitored process 14 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-03 08:59:21,712 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 (14)] Waiting until timeout for monitored process [2024-11-03 08:59:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:21,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 08:59:21,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 08:59:21,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 08:59:21,820 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:21,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476133283] [2024-11-03 08:59:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1476133283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:59:21,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:59:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-03 08:59:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740020434] [2024-11-03 08:59:21,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:59:21,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-03 08:59:21,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-03 08:59:21,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-03 08:59:21,822 INFO L87 Difference]: Start difference. First operand 3228 states and 4452 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:22,067 INFO L93 Difference]: Finished difference Result 6514 states and 8959 transitions. [2024-11-03 08:59:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 08:59:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-03 08:59:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:22,076 INFO L225 Difference]: With dead ends: 6514 [2024-11-03 08:59:22,076 INFO L226 Difference]: Without dead ends: 3327 [2024-11-03 08:59:22,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-03 08:59:22,080 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:22,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 95 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:59:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2024-11-03 08:59:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3050. [2024-11-03 08:59:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 3049 states have (on average 1.337159724499836) internal successors, (4077), 3049 states have internal predecessors, (4077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4077 transitions. [2024-11-03 08:59:22,240 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4077 transitions. Word has length 51 [2024-11-03 08:59:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:22,240 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 4077 transitions. [2024-11-03 08:59:22,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4077 transitions. [2024-11-03 08:59:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-03 08:59:22,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:22,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:22,247 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 (14)] Ended with exit code 0 [2024-11-03 08:59:22,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-03 08:59:22,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 592562209, now seen corresponding path program 1 times [2024-11-03 08:59:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:22,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176227971] [2024-11-03 08:59:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:22,445 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-03 08:59:22,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:22,447 INFO L229 MonitoredProcess]: Starting monitored process 15 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-03 08:59:22,449 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 (15)] Waiting until timeout for monitored process [2024-11-03 08:59:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:22,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 08:59:22,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-03 08:59:22,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-03 08:59:22,642 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176227971] [2024-11-03 08:59:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [176227971] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 08:59:22,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 08:59:22,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-03 08:59:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228399796] [2024-11-03 08:59:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:22,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 08:59:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:22,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 08:59:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-03 08:59:22,644 INFO L87 Difference]: Start difference. First operand 3050 states and 4077 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:22,911 INFO L93 Difference]: Finished difference Result 3779 states and 5032 transitions. [2024-11-03 08:59:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 08:59:22,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-03 08:59:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:22,922 INFO L225 Difference]: With dead ends: 3779 [2024-11-03 08:59:22,922 INFO L226 Difference]: Without dead ends: 3052 [2024-11-03 08:59:22,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-03 08:59:22,925 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 146 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:22,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 396 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:59:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2024-11-03 08:59:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 3044. [2024-11-03 08:59:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 3043 states have (on average 1.3355241537955964) internal successors, (4064), 3043 states have internal predecessors, (4064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 4064 transitions. [2024-11-03 08:59:23,080 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 4064 transitions. Word has length 51 [2024-11-03 08:59:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:23,081 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 4064 transitions. [2024-11-03 08:59:23,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 08:59:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 4064 transitions. [2024-11-03 08:59:23,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-03 08:59:23,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:23,084 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:23,087 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 (15)] Ended with exit code 0 [2024-11-03 08:59:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-03 08:59:23,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1950719985, now seen corresponding path program 1 times [2024-11-03 08:59:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95244212] [2024-11-03 08:59:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:23,286 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-03 08:59:23,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:23,289 INFO L229 MonitoredProcess]: Starting monitored process 16 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-03 08:59:23,290 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 (16)] Waiting until timeout for monitored process [2024-11-03 08:59:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 08:59:23,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 08:59:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 08:59:23,382 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 08:59:23,382 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 08:59:23,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 08:59:23,389 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 (16)] Ended with exit code 0 [2024-11-03 08:59:23,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-03 08:59:23,588 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:23,649 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 08:59:23,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 08:59:23 BoogieIcfgContainer [2024-11-03 08:59:23,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 08:59:23,652 INFO L158 Benchmark]: Toolchain (without parser) took 22699.21ms. Allocated memory was 212.9MB in the beginning and 487.6MB in the end (delta: 274.7MB). Free memory was 159.0MB in the beginning and 172.0MB in the end (delta: -13.0MB). Peak memory consumption was 263.1MB. Max. memory is 8.0GB. [2024-11-03 08:59:23,652 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 212.9MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 08:59:23,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.01ms. Allocated memory is still 212.9MB. Free memory was 158.7MB in the beginning and 143.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-03 08:59:23,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.40ms. Allocated memory is still 212.9MB. Free memory was 143.9MB in the beginning and 142.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 08:59:23,653 INFO L158 Benchmark]: Boogie Preprocessor took 49.49ms. Allocated memory is still 212.9MB. Free memory was 142.2MB in the beginning and 139.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 08:59:23,653 INFO L158 Benchmark]: RCFGBuilder took 581.54ms. Allocated memory was 212.9MB in the beginning and 405.8MB in the end (delta: 192.9MB). Free memory was 139.5MB in the beginning and 369.1MB in the end (delta: -229.6MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2024-11-03 08:59:23,653 INFO L158 Benchmark]: TraceAbstraction took 21704.47ms. Allocated memory was 405.8MB in the beginning and 487.6MB in the end (delta: 81.8MB). Free memory was 367.7MB in the beginning and 172.0MB in the end (delta: 195.7MB). Peak memory consumption was 278.4MB. Max. memory is 8.0GB. [2024-11-03 08:59:23,654 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.14ms. Allocated memory is still 212.9MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.01ms. Allocated memory is still 212.9MB. Free memory was 158.7MB in the beginning and 143.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.40ms. Allocated memory is still 212.9MB. Free memory was 143.9MB in the beginning and 142.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.49ms. Allocated memory is still 212.9MB. Free memory was 142.2MB in the beginning and 139.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 581.54ms. Allocated memory was 212.9MB in the beginning and 405.8MB in the end (delta: 192.9MB). Free memory was 139.5MB in the beginning and 369.1MB in the end (delta: -229.6MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. * TraceAbstraction took 21704.47ms. Allocated memory was 405.8MB in the beginning and 487.6MB in the end (delta: 81.8MB). Free memory was 367.7MB in the beginning and 172.0MB in the end (delta: 195.7MB). Peak memory consumption was 278.4MB. 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: 25]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1] [L68] nb = (unsigned char)4 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L89] COND TRUE i < nb VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L104] i = i + (unsigned char)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L83] COND FALSE !(i < na) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L89] COND FALSE !(i < nb) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L104] i = i + (unsigned char)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L107] COND TRUE i < (unsigned char)4 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L108] COND FALSE !(i == (unsigned char)0) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L109] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L110] COND TRUE i == (unsigned char)2 [L110] r2 = (unsigned char)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1, r2=0] [L113] i = i + (unsigned char)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L107] COND TRUE i < (unsigned char)4 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND TRUE i == (unsigned char)3 [L111] r3 = (unsigned char)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L113] i = i + (unsigned char)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=4, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=511, a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, partial_sum=1] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4990 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4990 mSDsluCounter, 8745 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7578 mSDsCounter, 477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5914 IncrementalHoareTripleChecker+Invalid, 6391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 477 mSolverCounterUnsat, 1167 mSDtfsCounter, 5914 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 723 SyntacticMatches, 4 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3228occurred in iteration=12, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 3010 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 834 ConstructedInterpolants, 9 QuantifiedInterpolants, 6242 SizeOfPredicates, 13 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 28 InterpolantComputations, 20 PerfectInterpolantSequences, 115/148 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-03 08:59:23,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...