/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/modulus-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 00:09:29,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 00:09:29,872 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-06 00:09:29,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 00:09:29,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 00:09:29,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 00:09:29,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 00:09:29,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 00:09:29,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 00:09:29,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 00:09:29,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 00:09:29,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 00:09:29,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 00:09:29,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 00:09:29,913 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 00:09:29,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 00:09:29,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 00:09:29,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 00:09:29,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 00:09:29,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 00:09:29,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 00:09:29,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 00:09:29,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 00:09:29,919 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 00:09:29,919 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 00:09:29,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 00:09:29,920 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 00:09:29,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 00:09:29,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 00:09:29,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 00:09:29,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 00:09:29,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 00:09:29,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 00:09:29,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 00:09:29,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 00:09:29,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 00:09:29,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 00:09:29,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 00:09:29,922 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 00:09:29,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 00:09:29,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 00:09:29,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 00:09:29,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 00:09:29,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 00:09:29,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 00:09:30,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 00:09:30,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 00:09:30,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 00:09:30,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 00:09:30,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 00:09:30,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/modulus-2.i [2024-11-06 00:09:31,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 00:09:31,825 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 00:09:31,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/modulus-2.i [2024-11-06 00:09:31,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3d1b0b5/4eead04ee2a0425cb5b5bc1a5f916056/FLAG2d643ebb7 [2024-11-06 00:09:31,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3d1b0b5/4eead04ee2a0425cb5b5bc1a5f916056 [2024-11-06 00:09:31,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 00:09:31,850 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 00:09:31,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 00:09:31,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 00:09:31,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 00:09:31,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:09:31" (1/1) ... [2024-11-06 00:09:31,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f24e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:31, skipping insertion in model container [2024-11-06 00:09:31,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:09:31" (1/1) ... [2024-11-06 00:09:31,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 00:09:32,038 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/modulus-2.i[1252,1265] [2024-11-06 00:09:32,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 00:09:32,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 00:09:32,080 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/modulus-2.i[1252,1265] [2024-11-06 00:09:32,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 00:09:32,100 INFO L204 MainTranslator]: Completed translation [2024-11-06 00:09:32,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32 WrapperNode [2024-11-06 00:09:32,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 00:09:32,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 00:09:32,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 00:09:32,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 00:09:32,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,132 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-11-06 00:09:32,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 00:09:32,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 00:09:32,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 00:09:32,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 00:09:32,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,151 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 00:09:32,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 00:09:32,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 00:09:32,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 00:09:32,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 00:09:32,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (1/1) ... [2024-11-06 00:09:32,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 00:09:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 00:09:32,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 00:09:32,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 00:09:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 00:09:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 00:09:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 00:09:32,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 00:09:32,286 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 00:09:32,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 00:09:32,444 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-06 00:09:32,444 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 00:09:32,454 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 00:09:32,454 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 00:09:32,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:09:32 BoogieIcfgContainer [2024-11-06 00:09:32,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 00:09:32,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 00:09:32,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 00:09:32,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 00:09:32,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:09:31" (1/3) ... [2024-11-06 00:09:32,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fa3310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:09:32, skipping insertion in model container [2024-11-06 00:09:32,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:09:32" (2/3) ... [2024-11-06 00:09:32,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fa3310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:09:32, skipping insertion in model container [2024-11-06 00:09:32,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:09:32" (3/3) ... [2024-11-06 00:09:32,465 INFO L112 eAbstractionObserver]: Analyzing ICFG modulus-2.i [2024-11-06 00:09:32,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 00:09:32,482 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 00:09:32,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 00:09:32,539 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;@3b30614b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 00:09:32,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 00:09:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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-06 00:09:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 00:09:32,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:09:32,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:09:32,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:09:32,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:09:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1232845228, now seen corresponding path program 1 times [2024-11-06 00:09:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:09:32,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441677828] [2024-11-06 00:09:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:09:32,565 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-06 00:09:32,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:09:32,567 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-06 00:09:32,569 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-06 00:09:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:09:32,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 00:09:32,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:09:32,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-06 00:09:32,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:09:32,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:09:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441677828] [2024-11-06 00:09:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441677828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:09:32,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:09:32,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 00:09:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982861466] [2024-11-06 00:09:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:09:32,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 00:09:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:09:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 00:09:32,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 00:09:32,714 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-06 00:09:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:09:32,733 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2024-11-06 00:09:32,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 00:09:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-11-06 00:09:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:09:32,743 INFO L225 Difference]: With dead ends: 33 [2024-11-06 00:09:32,744 INFO L226 Difference]: Without dead ends: 13 [2024-11-06 00:09:32,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-06 00:09:32,753 INFO L432 NwaCegarLoop]: 21 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, 21 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-06 00:09:32,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 00:09:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-06 00:09:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-06 00:09:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 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-06 00:09:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-06 00:09:32,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-06 00:09:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:09:32,786 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-06 00:09:32,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-06 00:09:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-06 00:09:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 00:09:32,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:09:32,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:09:32,797 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-06 00:09:32,989 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-06 00:09:32,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:09:32,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:09:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2042191854, now seen corresponding path program 1 times [2024-11-06 00:09:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:09:32,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116926473] [2024-11-06 00:09:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:09:32,993 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-06 00:09:32,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:09:32,997 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-06 00:09:33,000 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-06 00:09:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:09:33,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 00:09:33,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:09:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:09:33,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:09:33,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:09:33,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116926473] [2024-11-06 00:09:33,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116926473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:09:33,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:09:33,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 00:09:33,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649021078] [2024-11-06 00:09:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:09:33,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 00:09:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:09:33,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 00:09:33,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 00:09:33,647 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-06 00:09:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:09:33,967 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2024-11-06 00:09:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 00:09:33,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 10 [2024-11-06 00:09:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:09:33,969 INFO L225 Difference]: With dead ends: 20 [2024-11-06 00:09:33,969 INFO L226 Difference]: Without dead ends: 16 [2024-11-06 00:09:33,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-06 00:09:33,971 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 00:09:33,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 00:09:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-06 00:09:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-06 00:09:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-06 00:09:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-06 00:09:33,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2024-11-06 00:09:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:09:33,983 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-06 00:09:33,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-06 00:09:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-11-06 00:09:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 00:09:33,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:09:33,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:09:34,002 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-06 00:09:34,189 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-06 00:09:34,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:09:34,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:09:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2042132272, now seen corresponding path program 1 times [2024-11-06 00:09:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:09:34,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212699074] [2024-11-06 00:09:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:09:34,192 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-06 00:09:34,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:09:34,196 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-06 00:09:34,198 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-06 00:09:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:09:34,851 WARN L253 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 00:09:34,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:09:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:09:35,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:09:35,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:09:35,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212699074] [2024-11-06 00:09:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212699074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:09:35,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:09:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 00:09:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695859495] [2024-11-06 00:09:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:09:35,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 00:09:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:09:35,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 00:09:35,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-06 00:09:35,441 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-06 00:09:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:09:35,783 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-06 00:09:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 00:09:35,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 10 [2024-11-06 00:09:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:09:35,784 INFO L225 Difference]: With dead ends: 19 [2024-11-06 00:09:35,784 INFO L226 Difference]: Without dead ends: 14 [2024-11-06 00:09:35,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-06 00:09:35,786 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 00:09:35,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 00:09:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-06 00:09:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-06 00:09:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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-06 00:09:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-06 00:09:35,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2024-11-06 00:09:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:09:35,791 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-06 00:09:35,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-06 00:09:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-06 00:09:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-06 00:09:35,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:09:35,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:09:35,798 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 (4)] Forceful destruction successful, exit code 0 [2024-11-06 00:09:35,993 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-06 00:09:35,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:09:35,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:09:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 387361989, now seen corresponding path program 1 times [2024-11-06 00:09:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:09:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145735365] [2024-11-06 00:09:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:09:35,996 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-06 00:09:35,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:09:35,999 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-06 00:09:36,000 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-06 00:09:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:09:36,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 00:09:36,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:09:36,083 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-06 00:09:36,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:09:36,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:09:36,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145735365] [2024-11-06 00:09:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145735365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:09:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:09:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 00:09:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109856791] [2024-11-06 00:09:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:09:36,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 00:09:36,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:09:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 00:09:36,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 00:09:36,090 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 00:09:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:09:36,141 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-11-06 00:09:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 00:09:36,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-06 00:09:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:09:36,146 INFO L225 Difference]: With dead ends: 23 [2024-11-06 00:09:36,146 INFO L226 Difference]: Without dead ends: 15 [2024-11-06 00:09:36,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 00:09:36,147 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 00:09:36,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 00:09:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-06 00:09:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-06 00:09:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-06 00:09:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-06 00:09:36,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2024-11-06 00:09:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:09:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-06 00:09:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 00:09:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-06 00:09:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 00:09:36,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:09:36,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:09:36,166 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-06 00:09:36,360 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-06 00:09:36,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:09:36,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:09:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1988806915, now seen corresponding path program 1 times [2024-11-06 00:09:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:09:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187629481] [2024-11-06 00:09:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:09:36,363 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-06 00:09:36,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:09:36,366 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-06 00:09:36,368 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-06 00:09:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:09:36,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 00:09:36,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:09:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:09:36,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:09:40,967 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-06 00:09:40,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:09:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187629481] [2024-11-06 00:09:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187629481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:09:40,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:09:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-06 00:09:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276081718] [2024-11-06 00:09:40,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:09:40,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 00:09:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:09:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 00:09:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2024-11-06 00:09:40,970 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-06 00:09:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:09:41,503 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-06 00:09:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 00:09:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-06 00:09:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:09:41,510 INFO L225 Difference]: With dead ends: 26 [2024-11-06 00:09:41,510 INFO L226 Difference]: Without dead ends: 17 [2024-11-06 00:09:41,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=61, Invalid=148, Unknown=1, NotChecked=0, Total=210 [2024-11-06 00:09:41,511 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 00:09:41,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 25 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 00:09:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-06 00:09:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-06 00:09:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-06 00:09:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-06 00:09:41,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2024-11-06 00:09:41,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:09:41,519 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-06 00:09:41,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-06 00:09:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-06 00:09:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 00:09:41,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:09:41,520 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:09:41,527 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-06 00:09:41,722 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-06 00:09:41,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:09:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:09:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 93992069, now seen corresponding path program 2 times [2024-11-06 00:09:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:09:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978639234] [2024-11-06 00:09:41,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 00:09:41,724 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-06 00:09:41,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:09:41,725 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-06 00:09:41,727 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-06 00:09:41,860 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 00:09:41,860 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:09:41,868 WARN L253 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 00:09:41,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:09:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:09:45,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:09:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 00:09:51,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:09:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978639234] [2024-11-06 00:09:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978639234] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 00:09:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 00:09:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2024-11-06 00:09:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045359455] [2024-11-06 00:09:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:09:51,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 00:09:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:09:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 00:09:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2024-11-06 00:09:51,240 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-06 00:09:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:09:54,399 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-06 00:09:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 00:09:54,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 15 [2024-11-06 00:09:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:09:54,400 INFO L225 Difference]: With dead ends: 20 [2024-11-06 00:09:54,400 INFO L226 Difference]: Without dead ends: 16 [2024-11-06 00:09:54,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=49, Invalid=222, Unknown=1, NotChecked=0, Total=272 [2024-11-06 00:09:54,401 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 00:09:54,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 00:09:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-06 00:09:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-06 00:09:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-06 00:09:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-06 00:09:54,408 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2024-11-06 00:09:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:09:54,408 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-06 00:09:54,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-06 00:09:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-06 00:09:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 00:09:54,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:09:54,409 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:09:54,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 00:09:54,613 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-06 00:09:54,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:09:54,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:09:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash 94051651, now seen corresponding path program 1 times [2024-11-06 00:09:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:09:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140632265] [2024-11-06 00:09:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:09:54,615 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-06 00:09:54,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:09:54,618 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-06 00:09:54,619 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-06 00:09:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:09:55,120 WARN L253 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 00:09:55,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:09:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:09:57,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:10:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 00:10:00,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:10:00,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140632265] [2024-11-06 00:10:00,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140632265] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 00:10:00,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 00:10:00,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2024-11-06 00:10:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233682647] [2024-11-06 00:10:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:10:00,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 00:10:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:10:00,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 00:10:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-06 00:10:00,467 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-06 00:10:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:10:00,994 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2024-11-06 00:10:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 00:10:01,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 15 [2024-11-06 00:10:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:10:01,005 INFO L225 Difference]: With dead ends: 16 [2024-11-06 00:10:01,005 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 00:10:01,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-06 00:10:01,006 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 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.5s IncrementalHoareTripleChecker+Time [2024-11-06 00:10:01,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 00:10:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 00:10:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 00:10:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-06 00:10:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 00:10:01,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-11-06 00:10:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:10:01,007 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 00:10:01,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-06 00:10:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 00:10:01,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 00:10:01,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 00:10:01,017 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-06 00:10:01,211 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-06 00:10:01,215 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-06 00:10:01,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 00:10:02,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 00:10:02,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~bvlshr~32 [2024-11-06 00:10:02,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 00:10:02,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 00:10:02,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:10:02 BoogieIcfgContainer [2024-11-06 00:10:02,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 00:10:02,450 INFO L158 Benchmark]: Toolchain (without parser) took 30599.90ms. Allocated memory is still 277.9MB. Free memory was 233.8MB in the beginning and 128.1MB in the end (delta: 105.7MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. [2024-11-06 00:10:02,450 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 206.6MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 00:10:02,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.94ms. Allocated memory is still 277.9MB. Free memory was 233.8MB in the beginning and 220.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-06 00:10:02,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.27ms. Allocated memory is still 277.9MB. Free memory was 220.7MB in the beginning and 219.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-06 00:10:02,451 INFO L158 Benchmark]: Boogie Preprocessor took 29.78ms. Allocated memory is still 277.9MB. Free memory was 219.6MB in the beginning and 217.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 00:10:02,451 INFO L158 Benchmark]: RCFGBuilder took 289.23ms. Allocated memory is still 277.9MB. Free memory was 217.5MB in the beginning and 207.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-11-06 00:10:02,451 INFO L158 Benchmark]: TraceAbstraction took 29992.31ms. Allocated memory is still 277.9MB. Free memory was 206.5MB in the beginning and 128.1MB in the end (delta: 78.4MB). Peak memory consumption was 80.0MB. Max. memory is 8.0GB. [2024-11-06 00:10:02,454 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 206.6MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.94ms. Allocated memory is still 277.9MB. Free memory was 233.8MB in the beginning and 220.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.27ms. Allocated memory is still 277.9MB. Free memory was 220.7MB in the beginning and 219.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.78ms. Allocated memory is still 277.9MB. Free memory was 219.6MB in the beginning and 217.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 289.23ms. Allocated memory is still 277.9MB. Free memory was 217.5MB in the beginning and 207.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 29992.31ms. Allocated memory is still 277.9MB. Free memory was 206.5MB in the beginning and 128.1MB in the end (delta: 78.4MB). Peak memory consumption was 80.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~bvlshr~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 29]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 214 IncrementalHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 70 mSDtfsCounter, 214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 121 ConstructedInterpolants, 23 QuantifiedInterpolants, 1062 SizeOfPredicates, 7 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10/21 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((m == (n % d)) || (n > d)) || (m == d)) && (((d + 1) % 4294967296) == (1 << s))) && ((0 == (n % d)) || (m != d))) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((d + 1) % 4294967296) == (1 << s)) RESULT: Ultimate proved your program to be correct! [2024-11-06 00:10:02,508 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...