/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-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:28:28,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:28:28,517 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 08:28:28,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:28:28,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:28:28,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:28:28,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:28:28,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:28:28,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:28:28,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:28:28,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:28:28,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:28:28,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:28:28,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:28:28,551 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:28:28,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:28:28,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:28:28,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:28:28,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:28:28,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:28:28,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:28:28,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:28:28,557 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:28:28,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:28:28,557 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:28:28,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:28:28,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:28:28,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:28:28,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:28:28,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:28:28,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:28:28,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:28:28,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:28:28,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:28:28,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:28:28,559 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:28:28,559 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:28:28,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:28:28,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:28:28,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:28:28,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:28:28,560 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 08:28:28,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:28:28,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:28:28,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:28:28,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:28:28,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:28:28,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2024-11-05 08:28:30,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:28:30,197 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:28:30,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2024-11-05 08:28:30,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e95fd1d5/91604b20228044dbb765379e9bef442e/FLAG4d89c46ae [2024-11-05 08:28:30,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e95fd1d5/91604b20228044dbb765379e9bef442e [2024-11-05 08:28:30,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:28:30,221 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:28:30,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:28:30,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:28:30,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:28:30,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ee864c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30, skipping insertion in model container [2024-11-05 08:28:30,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:28:30,389 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-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c[1268,1281] [2024-11-05 08:28:30,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:28:30,536 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:28:30,544 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-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c[1268,1281] [2024-11-05 08:28:30,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:28:30,660 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:28:30,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30 WrapperNode [2024-11-05 08:28:30,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:28:30,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:28:30,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:28:30,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:28:30,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,741 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 959 [2024-11-05 08:28:30,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:28:30,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:28:30,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:28:30,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:28:30,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,807 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 4, 4]. [2024-11-05 08:28:30,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:28:30,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:28:30,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:28:30,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:28:30,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (1/1) ... [2024-11-05 08:28:30,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:28:30,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:28:30,894 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 08:28:30,896 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 08:28:30,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:28:30,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-05 08:28:30,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-05 08:28:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-05 08:28:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:28:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:28:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:28:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:28:30,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:28:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:28:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:28:30,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:28:30,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-05 08:28:30,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-05 08:28:30,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-05 08:28:30,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:28:31,118 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:28:31,120 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:28:31,793 INFO L? ?]: Removed 681 outVars from TransFormulas that were not future-live. [2024-11-05 08:28:31,793 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:28:31,808 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:28:31,808 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-05 08:28:31,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:28:31 BoogieIcfgContainer [2024-11-05 08:28:31,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:28:31,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:28:31,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:28:31,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:28:31,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:28:30" (1/3) ... [2024-11-05 08:28:31,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5ff00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:28:31, skipping insertion in model container [2024-11-05 08:28:31,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:30" (2/3) ... [2024-11-05 08:28:31,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5ff00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:28:31, skipping insertion in model container [2024-11-05 08:28:31,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:28:31" (3/3) ... [2024-11-05 08:28:31,817 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2024-11-05 08:28:31,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:28:31,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:28:31,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:28:31,903 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;@3c03daf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:28:31,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:28:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:28:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 08:28:31,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:31,915 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:31,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:31,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1919498836, now seen corresponding path program 1 times [2024-11-05 08:28:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1027598639] [2024-11-05 08:28:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:31,933 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 08:28:31,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:31,938 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 08:28:31,940 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 08:28:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:32,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:28:32,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-05 08:28:32,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:28:32,328 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1027598639] [2024-11-05 08:28:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1027598639] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:28:32,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:28:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:28:32,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718654744] [2024-11-05 08:28:32,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:28:32,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:28:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:32,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:28:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:28:32,356 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 08:28:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:32,373 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2024-11-05 08:28:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:28:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-11-05 08:28:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:32,380 INFO L225 Difference]: With dead ends: 77 [2024-11-05 08:28:32,380 INFO L226 Difference]: Without dead ends: 39 [2024-11-05 08:28:32,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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-05 08:28:32,386 INFO L432 NwaCegarLoop]: 49 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, 49 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-05 08:28:32,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-05 08:28:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-05 08:28:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:28:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-05 08:28:32,424 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 39 [2024-11-05 08:28:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:32,424 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-05 08:28:32,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 08:28:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-05 08:28:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 08:28:32,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:32,426 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:32,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 (2)] Ended with exit code 0 [2024-11-05 08:28:32,626 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 08:28:32,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:32,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1633554172, now seen corresponding path program 1 times [2024-11-05 08:28:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:32,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1055460323] [2024-11-05 08:28:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:32,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 08:28:32,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:32,633 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 08:28:32,642 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 08:28:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:32,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:28:32,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:28:32,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:28:33,012 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1055460323] [2024-11-05 08:28:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1055460323] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:28:33,013 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:28:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:28:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163467940] [2024-11-05 08:28:33,013 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:28:33,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:28:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:33,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:28:33,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:33,015 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:33,040 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2024-11-05 08:28:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:28:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 39 [2024-11-05 08:28:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:33,041 INFO L225 Difference]: With dead ends: 77 [2024-11-05 08:28:33,042 INFO L226 Difference]: Without dead ends: 42 [2024-11-05 08:28:33,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:33,043 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:33,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-05 08:28:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-05 08:28:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:28:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-05 08:28:33,051 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 39 [2024-11-05 08:28:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:33,051 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-05 08:28:33,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-05 08:28:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-05 08:28:33,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:33,054 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:33,059 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-05 08:28:33,254 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 08:28:33,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:33,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:33,255 INFO L85 PathProgramCache]: Analyzing trace with hash -682782464, now seen corresponding path program 1 times [2024-11-05 08:28:33,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1274278368] [2024-11-05 08:28:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:33,256 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 08:28:33,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:33,258 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 08:28:33,259 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 08:28:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:33,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:28:33,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:28:33,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:28:33,630 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1274278368] [2024-11-05 08:28:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1274278368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:33,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:33,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:28:33,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695951852] [2024-11-05 08:28:33,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:33,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:28:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:33,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:28:33,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:28:33,635 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:33,721 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2024-11-05 08:28:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:28:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 43 [2024-11-05 08:28:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:33,722 INFO L225 Difference]: With dead ends: 85 [2024-11-05 08:28:33,722 INFO L226 Difference]: Without dead ends: 50 [2024-11-05 08:28:33,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:28:33,723 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:33,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 223 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-05 08:28:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-05 08:28:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:28:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-05 08:28:33,728 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 43 [2024-11-05 08:28:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-05 08:28:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-05 08:28:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-05 08:28:33,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:33,729 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:33,734 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 08:28:33,933 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 08:28:33,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:33,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1659549432, now seen corresponding path program 2 times [2024-11-05 08:28:33,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:33,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515017575] [2024-11-05 08:28:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:33,935 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 08:28:33,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:33,938 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 08:28:33,938 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 08:28:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:34,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:28:34,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:28:34,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:28:34,392 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:34,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515017575] [2024-11-05 08:28:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [515017575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:34,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:34,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:28:34,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845290463] [2024-11-05 08:28:34,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:34,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:28:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:34,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:28:34,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:34,395 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:34,513 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2024-11-05 08:28:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:28:34,514 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 51 [2024-11-05 08:28:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:34,515 INFO L225 Difference]: With dead ends: 89 [2024-11-05 08:28:34,515 INFO L226 Difference]: Without dead ends: 54 [2024-11-05 08:28:34,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:34,516 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:34,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 355 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-05 08:28:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-05 08:28:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:28:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-05 08:28:34,526 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 51 [2024-11-05 08:28:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:34,526 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-05 08:28:34,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-05 08:28:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-05 08:28:34,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:34,527 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:34,534 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 08:28:34,731 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 08:28:34,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:34,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 488258804, now seen corresponding path program 3 times [2024-11-05 08:28:34,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:34,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1647085054] [2024-11-05 08:28:34,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:34,732 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 08:28:34,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:34,734 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 08:28:34,734 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 08:28:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:35,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:28:35,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:28:35,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:28:35,043 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:35,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1647085054] [2024-11-05 08:28:35,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1647085054] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:28:35,043 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:28:35,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:28:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901415121] [2024-11-05 08:28:35,044 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:28:35,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:28:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:35,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:28:35,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:35,045 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:35,063 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-11-05 08:28:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:28:35,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 55 [2024-11-05 08:28:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:35,064 INFO L225 Difference]: With dead ends: 89 [2024-11-05 08:28:35,064 INFO L226 Difference]: Without dead ends: 57 [2024-11-05 08:28:35,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:35,065 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:35,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-05 08:28:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-05 08:28:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:28:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-11-05 08:28:35,069 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 55 [2024-11-05 08:28:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:35,070 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-11-05 08:28:35,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-05 08:28:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-05 08:28:35,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:35,070 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:35,078 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 08:28:35,271 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 08:28:35,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -526560144, now seen corresponding path program 1 times [2024-11-05 08:28:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719460762] [2024-11-05 08:28:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:35,272 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 08:28:35,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:35,274 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-05 08:28:35,275 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-05 08:28:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:35,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:28:35,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:28:35,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:28:35,611 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:35,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719460762] [2024-11-05 08:28:35,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719460762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:35,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:35,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:28:35,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553352575] [2024-11-05 08:28:35,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:35,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:28:35,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:35,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:28:35,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:28:35,613 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:35,670 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2024-11-05 08:28:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:28:35,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 59 [2024-11-05 08:28:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:35,671 INFO L225 Difference]: With dead ends: 97 [2024-11-05 08:28:35,671 INFO L226 Difference]: Without dead ends: 65 [2024-11-05 08:28:35,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:28:35,672 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:35,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-05 08:28:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-05 08:28:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:28:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-05 08:28:35,677 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 59 [2024-11-05 08:28:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:35,677 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-05 08:28:35,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-05 08:28:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-05 08:28:35,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:35,678 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:35,689 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-05 08:28:35,878 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-05 08:28:35,879 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:35,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash -47044248, now seen corresponding path program 2 times [2024-11-05 08:28:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [858405431] [2024-11-05 08:28:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:35,879 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 08:28:35,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:35,880 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-05 08:28:35,881 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-05 08:28:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:36,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:28:36,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:28:36,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:28:36,310 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:36,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [858405431] [2024-11-05 08:28:36,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [858405431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:36,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:36,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:28:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178332539] [2024-11-05 08:28:36,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:36,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:28:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:28:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:36,311 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:36,414 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-11-05 08:28:36,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:28:36,416 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-05 08:28:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:36,418 INFO L225 Difference]: With dead ends: 101 [2024-11-05 08:28:36,418 INFO L226 Difference]: Without dead ends: 69 [2024-11-05 08:28:36,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:36,419 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:36,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 434 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-05 08:28:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-05 08:28:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:28:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-11-05 08:28:36,424 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 67 [2024-11-05 08:28:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:36,424 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-05 08:28:36,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:28:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-11-05 08:28:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-05 08:28:36,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:36,425 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:36,431 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-05 08:28:36,626 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-05 08:28:36,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:36,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash -515774748, now seen corresponding path program 3 times [2024-11-05 08:28:36,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:36,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1270856164] [2024-11-05 08:28:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:36,627 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 08:28:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:36,630 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:28:36,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 08:28:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:36,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 08:28:36,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-05 08:28:37,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-05 08:28:37,902 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:37,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1270856164] [2024-11-05 08:28:37,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1270856164] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:28:37,902 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:28:37,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2024-11-05 08:28:37,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684943428] [2024-11-05 08:28:37,903 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:28:37,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:28:37,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:37,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:28:37,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:28:37,904 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 08:28:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:38,129 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-11-05 08:28:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:28:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2024-11-05 08:28:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:38,131 INFO L225 Difference]: With dead ends: 83 [2024-11-05 08:28:38,131 INFO L226 Difference]: Without dead ends: 81 [2024-11-05 08:28:38,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:28:38,131 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:38,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 187 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:28:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-05 08:28:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-05 08:28:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 69 states have internal predecessors, (76), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2024-11-05 08:28:38,143 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 71 [2024-11-05 08:28:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:38,145 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2024-11-05 08:28:38,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 08:28:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2024-11-05 08:28:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-05 08:28:38,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:38,146 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:38,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-05 08:28:38,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:28:38,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:38,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1746558445, now seen corresponding path program 1 times [2024-11-05 08:28:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:38,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1652273629] [2024-11-05 08:28:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:38,353 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 08:28:38,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:38,354 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:28:38,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-05 08:28:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:39,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:28:39,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-05 08:28:39,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-05 08:28:39,055 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:39,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1652273629] [2024-11-05 08:28:39,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1652273629] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:28:39,055 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:28:39,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:28:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612174155] [2024-11-05 08:28:39,055 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:28:39,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:28:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:28:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:39,056 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:39,102 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2024-11-05 08:28:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:28:39,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2024-11-05 08:28:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:39,105 INFO L225 Difference]: With dead ends: 115 [2024-11-05 08:28:39,105 INFO L226 Difference]: Without dead ends: 84 [2024-11-05 08:28:39,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:39,106 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:39,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-05 08:28:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-05 08:28:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-11-05 08:28:39,115 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 112 [2024-11-05 08:28:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:39,115 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-11-05 08:28:39,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-11-05 08:28:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:28:39,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:39,116 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:39,127 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 (10)] Ended with exit code 0 [2024-11-05 08:28:39,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:28:39,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:39,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash -830156913, now seen corresponding path program 1 times [2024-11-05 08:28:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749890294] [2024-11-05 08:28:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:39,317 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 08:28:39,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:39,320 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:28:39,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 08:28:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:40,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:28:40,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-05 08:28:40,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-05 08:28:40,136 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:40,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749890294] [2024-11-05 08:28:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1749890294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:40,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:28:40,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317031111] [2024-11-05 08:28:40,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:40,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:28:40,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:40,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:28:40,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:28:40,138 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:40,239 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2024-11-05 08:28:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:28:40,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-05 08:28:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:40,245 INFO L225 Difference]: With dead ends: 126 [2024-11-05 08:28:40,245 INFO L226 Difference]: Without dead ends: 92 [2024-11-05 08:28:40,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:28:40,246 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:40,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 262 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-05 08:28:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-05 08:28:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.0875) internal successors, (87), 80 states have internal predecessors, (87), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2024-11-05 08:28:40,253 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 116 [2024-11-05 08:28:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:40,253 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2024-11-05 08:28:40,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2024-11-05 08:28:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 08:28:40,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:40,255 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:40,266 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 (11)] Forceful destruction successful, exit code 0 [2024-11-05 08:28:40,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:28:40,455 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:40,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 518049927, now seen corresponding path program 2 times [2024-11-05 08:28:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [953517454] [2024-11-05 08:28:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:40,456 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 08:28:40,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:40,458 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:28:40,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 08:28:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:41,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:28:41,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-05 08:28:41,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-05 08:28:41,361 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [953517454] [2024-11-05 08:28:41,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [953517454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:41,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:41,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:28:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280453535] [2024-11-05 08:28:41,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:41,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:28:41,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:28:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:41,363 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:41,498 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2024-11-05 08:28:41,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:28:41,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-05 08:28:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:41,504 INFO L225 Difference]: With dead ends: 138 [2024-11-05 08:28:41,504 INFO L226 Difference]: Without dead ends: 96 [2024-11-05 08:28:41,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:41,505 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:41,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 348 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-05 08:28:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-05 08:28:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 84 states have internal predecessors, (91), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-11-05 08:28:41,515 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 124 [2024-11-05 08:28:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:41,515 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-11-05 08:28:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-11-05 08:28:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-05 08:28:41,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:41,517 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:41,528 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 (12)] Ended with exit code 0 [2024-11-05 08:28:41,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:28:41,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:41,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash -291789821, now seen corresponding path program 3 times [2024-11-05 08:28:41,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:41,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [177230966] [2024-11-05 08:28:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:41,718 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 08:28:41,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:41,719 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:28:41,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 08:28:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:42,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:28:42,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-05 08:28:42,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-05 08:28:42,759 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [177230966] [2024-11-05 08:28:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [177230966] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:28:42,759 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:28:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:28:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416567133] [2024-11-05 08:28:42,759 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:28:42,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:28:42,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:42,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:28:42,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:42,760 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:42,787 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2024-11-05 08:28:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:28:42,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-11-05 08:28:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:42,789 INFO L225 Difference]: With dead ends: 145 [2024-11-05 08:28:42,790 INFO L226 Difference]: Without dead ends: 99 [2024-11-05 08:28:42,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:42,790 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:42,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-05 08:28:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-05 08:28:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.0804597701149425) internal successors, (94), 87 states have internal predecessors, (94), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-11-05 08:28:42,797 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 128 [2024-11-05 08:28:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:42,797 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-05 08:28:42,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-11-05 08:28:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-05 08:28:42,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:42,799 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:42,811 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 (13)] Ended with exit code 0 [2024-11-05 08:28:42,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:28:42,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:42,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash -297563905, now seen corresponding path program 1 times [2024-11-05 08:28:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026182218] [2024-11-05 08:28:43,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:43,000 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 08:28:43,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:43,001 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:28:43,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-05 08:28:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:44,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:28:44,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-05 08:28:44,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-05 08:28:44,137 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026182218] [2024-11-05 08:28:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1026182218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:44,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:28:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348961494] [2024-11-05 08:28:44,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:44,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:28:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:28:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:28:44,139 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:44,228 INFO L93 Difference]: Finished difference Result 156 states and 183 transitions. [2024-11-05 08:28:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:28:44,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-05 08:28:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:44,230 INFO L225 Difference]: With dead ends: 156 [2024-11-05 08:28:44,230 INFO L226 Difference]: Without dead ends: 107 [2024-11-05 08:28:44,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:28:44,231 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:44,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-05 08:28:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-05 08:28:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.0736842105263158) internal successors, (102), 95 states have internal predecessors, (102), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2024-11-05 08:28:44,238 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 132 [2024-11-05 08:28:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:44,238 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-11-05 08:28:44,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2024-11-05 08:28:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-05 08:28:44,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:44,239 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:44,255 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 (14)] Forceful destruction successful, exit code 0 [2024-11-05 08:28:44,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:28:44,440 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:44,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1407600393, now seen corresponding path program 2 times [2024-11-05 08:28:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997828785] [2024-11-05 08:28:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:44,441 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 08:28:44,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:44,442 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:28:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-05 08:28:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:45,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:28:45,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-05 08:28:45,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-05 08:28:45,801 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997828785] [2024-11-05 08:28:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [997828785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:45,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:45,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:28:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292252003] [2024-11-05 08:28:45,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:45,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:28:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:28:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:45,802 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:45,949 INFO L93 Difference]: Finished difference Result 168 states and 193 transitions. [2024-11-05 08:28:45,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:28:45,950 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2024-11-05 08:28:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:45,951 INFO L225 Difference]: With dead ends: 168 [2024-11-05 08:28:45,951 INFO L226 Difference]: Without dead ends: 111 [2024-11-05 08:28:45,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:45,952 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:45,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 391 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-05 08:28:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-05 08:28:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 99 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2024-11-05 08:28:45,959 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 140 [2024-11-05 08:28:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:45,959 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2024-11-05 08:28:45,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-11-05 08:28:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-05 08:28:45,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:45,960 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:45,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-05 08:28:46,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:28:46,161 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:46,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:46,161 INFO L85 PathProgramCache]: Analyzing trace with hash -469367821, now seen corresponding path program 3 times [2024-11-05 08:28:46,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:46,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584585922] [2024-11-05 08:28:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:46,161 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 08:28:46,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:46,163 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:28:46,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-05 08:28:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:47,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:28:47,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-05 08:28:47,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-05 08:28:47,590 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584585922] [2024-11-05 08:28:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [584585922] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:28:47,591 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:28:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:28:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281119866] [2024-11-05 08:28:47,591 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:28:47,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:28:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:28:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:47,592 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:47,615 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2024-11-05 08:28:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:28:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2024-11-05 08:28:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:47,616 INFO L225 Difference]: With dead ends: 175 [2024-11-05 08:28:47,616 INFO L226 Difference]: Without dead ends: 114 [2024-11-05 08:28:47,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:47,617 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:47,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-05 08:28:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-05 08:28:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.0686274509803921) internal successors, (109), 102 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2024-11-05 08:28:47,625 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 144 [2024-11-05 08:28:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:47,625 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2024-11-05 08:28:47,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2024-11-05 08:28:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-05 08:28:47,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:47,627 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:47,641 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 (16)] Forceful destruction successful, exit code 0 [2024-11-05 08:28:47,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:28:47,828 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:47,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1956806545, now seen corresponding path program 1 times [2024-11-05 08:28:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [69024185] [2024-11-05 08:28:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:47,828 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 08:28:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:47,829 INFO L229 MonitoredProcess]: Starting monitored process 17 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 08:28:47,830 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 (17)] Waiting until timeout for monitored process [2024-11-05 08:28:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:49,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:28:49,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-05 08:28:49,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-05 08:28:49,309 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:49,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [69024185] [2024-11-05 08:28:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [69024185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:49,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:28:49,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683634522] [2024-11-05 08:28:49,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:49,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:28:49,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:49,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:28:49,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:28:49,310 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:49,383 INFO L93 Difference]: Finished difference Result 186 states and 213 transitions. [2024-11-05 08:28:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:28:49,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 148 [2024-11-05 08:28:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:49,384 INFO L225 Difference]: With dead ends: 186 [2024-11-05 08:28:49,384 INFO L226 Difference]: Without dead ends: 122 [2024-11-05 08:28:49,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:28:49,385 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:49,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-05 08:28:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-05 08:28:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 110 states have (on average 1.0636363636363637) internal successors, (117), 110 states have internal predecessors, (117), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2024-11-05 08:28:49,395 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 148 [2024-11-05 08:28:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:49,396 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2024-11-05 08:28:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2024-11-05 08:28:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-05 08:28:49,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:49,397 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:49,410 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 (17)] Forceful destruction successful, exit code 0 [2024-11-05 08:28:49,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 08:28:49,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:49,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -525623449, now seen corresponding path program 2 times [2024-11-05 08:28:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:49,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2098131734] [2024-11-05 08:28:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:49,598 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 08:28:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:49,599 INFO L229 MonitoredProcess]: Starting monitored process 18 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 08:28:49,600 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 (18)] Waiting until timeout for monitored process [2024-11-05 08:28:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:51,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:28:51,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-05 08:28:51,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-05 08:28:51,275 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2098131734] [2024-11-05 08:28:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2098131734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:51,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:28:51,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106763721] [2024-11-05 08:28:51,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:51,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:28:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:28:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:51,276 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:51,395 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2024-11-05 08:28:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:28:51,395 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 156 [2024-11-05 08:28:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:51,396 INFO L225 Difference]: With dead ends: 198 [2024-11-05 08:28:51,396 INFO L226 Difference]: Without dead ends: 126 [2024-11-05 08:28:51,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:51,397 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:51,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 434 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-05 08:28:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-05 08:28:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 114 states have (on average 1.0614035087719298) internal successors, (121), 114 states have internal predecessors, (121), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2024-11-05 08:28:51,404 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 156 [2024-11-05 08:28:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:51,405 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2024-11-05 08:28:51,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2024-11-05 08:28:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-05 08:28:51,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:51,406 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:51,422 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 (18)] Forceful destruction successful, exit code 0 [2024-11-05 08:28:51,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 08:28:51,607 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:51,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1008746979, now seen corresponding path program 3 times [2024-11-05 08:28:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:51,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330282974] [2024-11-05 08:28:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:51,608 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 08:28:51,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:51,609 INFO L229 MonitoredProcess]: Starting monitored process 19 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 08:28:51,610 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 (19)] Waiting until timeout for monitored process [2024-11-05 08:28:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:53,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:28:53,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-05 08:28:53,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-05 08:28:53,292 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:53,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330282974] [2024-11-05 08:28:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1330282974] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:28:53,292 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:28:53,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:28:53,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709826669] [2024-11-05 08:28:53,293 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:28:53,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:28:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:53,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:28:53,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:53,293 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:53,313 INFO L93 Difference]: Finished difference Result 205 states and 230 transitions. [2024-11-05 08:28:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:28:53,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2024-11-05 08:28:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:53,314 INFO L225 Difference]: With dead ends: 205 [2024-11-05 08:28:53,314 INFO L226 Difference]: Without dead ends: 129 [2024-11-05 08:28:53,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:28:53,315 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:53,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-05 08:28:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-05 08:28:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 117 states have (on average 1.0598290598290598) internal successors, (124), 117 states have internal predecessors, (124), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2024-11-05 08:28:53,323 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 160 [2024-11-05 08:28:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:53,323 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2024-11-05 08:28:53,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2024-11-05 08:28:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-05 08:28:53,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:53,324 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:53,342 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 (19)] Forceful destruction successful, exit code 0 [2024-11-05 08:28:53,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 08:28:53,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:53,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:53,525 INFO L85 PathProgramCache]: Analyzing trace with hash 134624735, now seen corresponding path program 1 times [2024-11-05 08:28:53,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:53,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777966993] [2024-11-05 08:28:53,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:53,526 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 08:28:53,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:53,527 INFO L229 MonitoredProcess]: Starting monitored process 20 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 08:28:53,528 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 (20)] Waiting until timeout for monitored process [2024-11-05 08:28:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:55,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:28:55,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-05 08:28:55,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-05 08:28:55,281 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777966993] [2024-11-05 08:28:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [777966993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:55,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:55,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:28:55,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136292086] [2024-11-05 08:28:55,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:55,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:28:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:55,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:28:55,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:28:55,282 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:55,349 INFO L93 Difference]: Finished difference Result 216 states and 243 transitions. [2024-11-05 08:28:55,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:28:55,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2024-11-05 08:28:55,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:55,351 INFO L225 Difference]: With dead ends: 216 [2024-11-05 08:28:55,351 INFO L226 Difference]: Without dead ends: 137 [2024-11-05 08:28:55,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:28:55,352 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:55,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:28:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-05 08:28:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-05 08:28:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.056) internal successors, (132), 125 states have internal predecessors, (132), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2024-11-05 08:28:55,364 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 164 [2024-11-05 08:28:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:55,365 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2024-11-05 08:28:55,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2024-11-05 08:28:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-05 08:28:55,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:55,366 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:55,386 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 (20)] Ended with exit code 0 [2024-11-05 08:28:55,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 08:28:55,567 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:55,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash -952499241, now seen corresponding path program 2 times [2024-11-05 08:28:55,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:55,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1241674157] [2024-11-05 08:28:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:55,567 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 08:28:55,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:55,568 INFO L229 MonitoredProcess]: Starting monitored process 21 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 08:28:55,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 (21)] Waiting until timeout for monitored process [2024-11-05 08:28:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:28:57,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:28:57,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:28:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-05 08:28:57,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:28:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-05 08:28:57,656 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:28:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1241674157] [2024-11-05 08:28:57,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1241674157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:28:57,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:28:57,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:28:57,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110972802] [2024-11-05 08:28:57,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:28:57,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:28:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:28:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:28:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:57,658 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:28:57,754 INFO L93 Difference]: Finished difference Result 228 states and 253 transitions. [2024-11-05 08:28:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:28:57,755 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2024-11-05 08:28:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:28:57,756 INFO L225 Difference]: With dead ends: 228 [2024-11-05 08:28:57,756 INFO L226 Difference]: Without dead ends: 141 [2024-11-05 08:28:57,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:28:57,756 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:28:57,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 348 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:28:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-05 08:28:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-05 08:28:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.054263565891473) internal successors, (136), 129 states have internal predecessors, (136), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:28:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2024-11-05 08:28:57,764 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 172 [2024-11-05 08:28:57,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:28:57,765 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2024-11-05 08:28:57,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:28:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2024-11-05 08:28:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-05 08:28:57,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:28:57,766 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:28:57,787 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 (21)] Ended with exit code 0 [2024-11-05 08:28:57,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 08:28:57,970 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:28:57,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:28:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash 197516755, now seen corresponding path program 3 times [2024-11-05 08:28:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:28:57,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812756660] [2024-11-05 08:28:57,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:28:57,970 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 08:28:57,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:28:57,972 INFO L229 MonitoredProcess]: Starting monitored process 22 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 08:28:57,972 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 (22)] Waiting until timeout for monitored process [2024-11-05 08:29:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:00,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-05 08:29:00,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-05 08:29:04,844 INFO L311 TraceCheckSpWp]: Computing backward predicates...