/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 10:08:12,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 10:08:12,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 10:08:12,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 10:08:12,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 10:08:12,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 10:08:12,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 10:08:12,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 10:08:12,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 10:08:12,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 10:08:12,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 10:08:12,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 10:08:12,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 10:08:12,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 10:08:12,274 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 10:08:12,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 10:08:12,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 10:08:12,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 10:08:12,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 10:08:12,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 10:08:12,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 10:08:12,283 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 10:08:12,283 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 10:08:12,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 10:08:12,284 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 10:08:12,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 10:08:12,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 10:08:12,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 10:08:12,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 10:08:12,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 10:08:12,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 10:08:12,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 10:08:12,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 10:08:12,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 10:08:12,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 10:08:12,287 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 10:08:12,287 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 10:08:12,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 10:08:12,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 10:08:12,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 10:08:12,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 10:08:12,288 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-05 10:08:12,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 10:08:12,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 10:08:12,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 10:08:12,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 10:08:12,525 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 10:08:12,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c [2024-11-05 10:08:13,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 10:08:14,161 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 10:08:14,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c [2024-11-05 10:08:14,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed204b8c/1bcbec89596d44e8be88da72ffd37549/FLAGda4b681ea [2024-11-05 10:08:14,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed204b8c/1bcbec89596d44e8be88da72ffd37549 [2024-11-05 10:08:14,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 10:08:14,186 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 10:08:14,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 10:08:14,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 10:08:14,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 10:08:14,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8926c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14, skipping insertion in model container [2024-11-05 10:08:14,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 10:08:14,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c[1258,1271] [2024-11-05 10:08:14,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 10:08:14,418 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 10:08:14,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c[1258,1271] [2024-11-05 10:08:14,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 10:08:14,451 INFO L204 MainTranslator]: Completed translation [2024-11-05 10:08:14,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14 WrapperNode [2024-11-05 10:08:14,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 10:08:14,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 10:08:14,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 10:08:14,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 10:08:14,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,479 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2024-11-05 10:08:14,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 10:08:14,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 10:08:14,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 10:08:14,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 10:08:14,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,501 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 10:08:14,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 10:08:14,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 10:08:14,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 10:08:14,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 10:08:14,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (1/1) ... [2024-11-05 10:08:14,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 10:08:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 10:08:14,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 10:08:14,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 10:08:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 10:08:14,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 10:08:14,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 10:08:14,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 10:08:14,698 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 10:08:14,701 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 10:08:14,899 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-05 10:08:14,901 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 10:08:14,916 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 10:08:14,919 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 10:08:14,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:08:14 BoogieIcfgContainer [2024-11-05 10:08:14,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 10:08:14,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 10:08:14,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 10:08:14,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 10:08:14,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 10:08:14" (1/3) ... [2024-11-05 10:08:14,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e80c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:08:14, skipping insertion in model container [2024-11-05 10:08:14,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:08:14" (2/3) ... [2024-11-05 10:08:14,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e80c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:08:14, skipping insertion in model container [2024-11-05 10:08:14,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:08:14" (3/3) ... [2024-11-05 10:08:14,931 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.recount4.c [2024-11-05 10:08:14,948 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 10:08:14,948 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 10:08:14,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 10:08:15,005 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;@1ae807cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 10:08:15,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 10:08:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-05 10:08:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-05 10:08:15,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:08:15,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-05 10:08:15,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:08:15,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:08:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-05 10:08:15,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:08:15,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2052356417] [2024-11-05 10:08:15,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:08:15,032 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-05 10:08:15,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:08:15,034 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-05 10:08:15,035 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-05 10:08:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 10:08:15,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 10:08:15,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 10:08:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:08:15,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 10:08:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:08:15,338 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 10:08:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2052356417] [2024-11-05 10:08:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2052356417] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 10:08:15,339 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 10:08:15,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 10:08:15,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263387883] [2024-11-05 10:08:15,343 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 10:08:15,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 10:08:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 10:08:15,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 10:08:15,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 10:08:15,378 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-05 10:08:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 10:08:15,422 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-05 10:08:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 10:08:15,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 5 [2024-11-05 10:08:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 10:08:15,434 INFO L225 Difference]: With dead ends: 18 [2024-11-05 10:08:15,434 INFO L226 Difference]: Without dead ends: 10 [2024-11-05 10:08:15,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 10:08:15,440 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 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-05 10:08:15,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 10:08:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-05 10:08:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-05 10:08:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-05 10:08:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-05 10:08:15,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-05 10:08:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 10:08:15,467 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-05 10:08:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-05 10:08:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-05 10:08:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-05 10:08:15,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:08:15,468 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-05 10:08:15,473 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-05 10:08:15,669 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-05 10:08:15,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:08:15,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:08:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-05 10:08:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:08:15,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [625583795] [2024-11-05 10:08:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:08:15,674 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-05 10:08:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:08:15,678 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-05 10:08:15,679 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-05 10:08:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 10:08:15,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 10:08:15,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 10:08:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:08:16,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 10:08:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:08:16,236 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 10:08:16,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [625583795] [2024-11-05 10:08:16,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [625583795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 10:08:16,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 10:08:16,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 10:08:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477275116] [2024-11-05 10:08:16,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 10:08:16,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 10:08:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 10:08:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 10:08:16,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-05 10:08:16,242 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-05 10:08:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 10:08:16,386 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-05 10:08:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 10:08:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2024-11-05 10:08:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 10:08:16,388 INFO L225 Difference]: With dead ends: 18 [2024-11-05 10:08:16,388 INFO L226 Difference]: Without dead ends: 16 [2024-11-05 10:08:16,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-05 10:08:16,391 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 10:08:16,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 10:08:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-05 10:08:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-05 10:08:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-05 10:08:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-05 10:08:16,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-05 10:08:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 10:08:16,423 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-05 10:08:16,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-05 10:08:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-05 10:08:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-05 10:08:16,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:08:16,426 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-05 10:08:16,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 10:08:16,627 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-05 10:08:16,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:08:16,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:08:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-05 10:08:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:08:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1698218086] [2024-11-05 10:08:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:08:16,629 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-05 10:08:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:08:16,631 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-05 10:08:16,632 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-05 10:08:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 10:08:16,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-05 10:08:16,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 10:08:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:08:17,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 10:08:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:08:18,350 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 10:08:18,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1698218086] [2024-11-05 10:08:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1698218086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 10:08:18,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 10:08:18,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-11-05 10:08:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761298171] [2024-11-05 10:08:18,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 10:08:18,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 10:08:18,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 10:08:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 10:08:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-05 10:08:18,356 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-05 10:08:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 10:08:19,069 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-05 10:08:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 10:08:19,069 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-05 10:08:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 10:08:19,070 INFO L225 Difference]: With dead ends: 30 [2024-11-05 10:08:19,070 INFO L226 Difference]: Without dead ends: 28 [2024-11-05 10:08:19,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-11-05 10:08:19,072 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 10:08:19,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 19 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 10:08:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-05 10:08:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-05 10:08:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-05 10:08:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-05 10:08:19,079 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-05 10:08:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 10:08:19,079 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-05 10:08:19,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-05 10:08:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-05 10:08:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 10:08:19,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:08:19,081 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-05 10:08:19,084 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-05 10:08:19,284 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-05 10:08:19,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:08:19,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:08:19,285 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-05 10:08:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:08:19,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106190787] [2024-11-05 10:08:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:08:19,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-05 10:08:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:08:19,289 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-05 10:08:19,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 (5)] Waiting until timeout for monitored process [2024-11-05 10:08:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 10:08:19,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-05 10:08:19,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 10:08:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:08:20,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 10:08:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:08:27,748 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 10:08:27,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106190787] [2024-11-05 10:08:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [106190787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 10:08:27,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 10:08:27,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-11-05 10:08:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871942097] [2024-11-05 10:08:27,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 10:08:27,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-05 10:08:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 10:08:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-05 10:08:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506 [2024-11-05 10:08:27,751 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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-05 10:08:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 10:08:31,860 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-05 10:08:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-05 10:08:31,861 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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 26 [2024-11-05 10:08:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 10:08:31,862 INFO L225 Difference]: With dead ends: 54 [2024-11-05 10:08:31,862 INFO L226 Difference]: Without dead ends: 52 [2024-11-05 10:08:31,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=690, Invalid=1202, Unknown=0, NotChecked=0, Total=1892 [2024-11-05 10:08:31,864 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 10:08:31,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 10:08:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-05 10:08:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-05 10:08:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-05 10:08:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-05 10:08:31,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2024-11-05 10:08:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 10:08:31,881 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-05 10:08:31,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 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-05 10:08:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-05 10:08:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 10:08:31,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:08:31,882 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2024-11-05 10:08:31,887 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-05 10:08:32,083 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-05 10:08:32,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:08:32,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:08:32,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2084907299, now seen corresponding path program 4 times [2024-11-05 10:08:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:08:32,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [832053649] [2024-11-05 10:08:32,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:08:32,085 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-05 10:08:32,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:08:32,086 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-05 10:08:32,087 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-05 10:08:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 10:08:32,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 10:08:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 10:08:32,535 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 10:08:32,535 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 10:08:32,536 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 10:08:32,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 10:08:32,738 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-05 10:08:32,741 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-05 10:08:32,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 10:08:32,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 10:08:32 BoogieIcfgContainer [2024-11-05 10:08:32,793 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 10:08:32,793 INFO L158 Benchmark]: Toolchain (without parser) took 18606.74ms. Allocated memory was 211.8MB in the beginning and 609.2MB in the end (delta: 397.4MB). Free memory was 149.2MB in the beginning and 526.9MB in the end (delta: -377.6MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. [2024-11-05 10:08:32,793 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 211.8MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 10:08:32,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.46ms. Allocated memory is still 211.8MB. Free memory was 149.0MB in the beginning and 135.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-05 10:08:32,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.64ms. Allocated memory is still 211.8MB. Free memory was 135.6MB in the beginning and 133.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 10:08:32,794 INFO L158 Benchmark]: Boogie Preprocessor took 32.86ms. Allocated memory is still 211.8MB. Free memory was 133.8MB in the beginning and 132.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 10:08:32,794 INFO L158 Benchmark]: RCFGBuilder took 406.20ms. Allocated memory was 211.8MB in the beginning and 291.5MB in the end (delta: 79.7MB). Free memory was 132.0MB in the beginning and 248.4MB in the end (delta: -116.4MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2024-11-05 10:08:32,795 INFO L158 Benchmark]: TraceAbstraction took 17870.01ms. Allocated memory was 291.5MB in the beginning and 609.2MB in the end (delta: 317.7MB). Free memory was 247.6MB in the beginning and 526.9MB in the end (delta: -279.3MB). Peak memory consumption was 37.9MB. Max. memory is 8.0GB. [2024-11-05 10:08:32,796 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 211.8MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.46ms. Allocated memory is still 211.8MB. Free memory was 149.0MB in the beginning and 135.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.64ms. Allocated memory is still 211.8MB. Free memory was 135.6MB in the beginning and 133.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.86ms. Allocated memory is still 211.8MB. Free memory was 133.8MB in the beginning and 132.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.20ms. Allocated memory was 211.8MB in the beginning and 291.5MB in the end (delta: 79.7MB). Free memory was 132.0MB in the beginning and 248.4MB in the end (delta: -116.4MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * TraceAbstraction took 17870.01ms. Allocated memory was 291.5MB in the beginning and 609.2MB in the end (delta: 317.7MB). Free memory was 247.6MB in the beginning and 526.9MB in the end (delta: -279.3MB). Peak memory consumption was 37.9MB. 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: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L31] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L33] const SORT_4 var_5 = 0; [L34] const SORT_4 var_8 = 1; [L35] const SORT_4 var_13 = mask_SORT_4; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L42] SORT_4 init_7_arg_1 = var_5; [L43] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_13=15, var_5=0, var_8=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 16 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 25955 SizeOfPredicates, 41 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-05 10:08:32,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...