/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-nonlinear/color-magicseries1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 22:13:56,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 22:13:56,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 22:13:56,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 22:13:56,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 22:13:56,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 22:13:56,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 22:13:56,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 22:13:56,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 22:13:56,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 22:13:56,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 22:13:56,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 22:13:56,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 22:13:56,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 22:13:56,349 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 22:13:56,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 22:13:56,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 22:13:56,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 22:13:56,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 22:13:56,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 22:13:56,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 22:13:56,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 22:13:56,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 22:13:56,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 22:13:56,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 22:13:56,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 22:13:56,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 22:13:56,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 22:13:56,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 22:13:56,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 22:13:56,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 22:13:56,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 22:13:56,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 22:13:56,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 22:13:56,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 22:13:56,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 22:13:56,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 22:13:56,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 22:13:56,358 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 22:13:56,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 22:13:56,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 22:13:56,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 22:13:56,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 22:13:56,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 22:13:56,359 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 22:13:56,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 22:13:56,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 22:13:56,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 22:13:56,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 22:13:56,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 22:13:56,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-nonlinear/color-magicseries1.c [2024-11-05 22:13:58,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 22:13:58,182 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 22:13:58,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries1.c [2024-11-05 22:13:58,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e11ac8c/c7563c1044044068b535ca41e06f4f33/FLAGf9f1c5226 [2024-11-05 22:13:58,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e11ac8c/c7563c1044044068b535ca41e06f4f33 [2024-11-05 22:13:58,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 22:13:58,203 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 22:13:58,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 22:13:58,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 22:13:58,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 22:13:58,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da1e471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58, skipping insertion in model container [2024-11-05 22:13:58,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 22:13:58,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries1.c[613,626] [2024-11-05 22:13:58,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 22:13:58,408 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 22:13:58,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries1.c[613,626] [2024-11-05 22:13:58,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 22:13:58,444 INFO L204 MainTranslator]: Completed translation [2024-11-05 22:13:58,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58 WrapperNode [2024-11-05 22:13:58,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 22:13:58,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 22:13:58,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 22:13:58,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 22:13:58,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,486 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-11-05 22:13:58,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 22:13:58,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 22:13:58,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 22:13:58,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 22:13:58,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,517 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-05 22:13:58,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 22:13:58,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 22:13:58,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 22:13:58,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 22:13:58,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (1/1) ... [2024-11-05 22:13:58,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 22:13:58,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 22:13:58,568 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 22:13:58,571 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 22:13:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 22:13:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 22:13:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 22:13:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-05 22:13:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-05 22:13:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 22:13:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-05 22:13:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-05 22:13:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-05 22:13:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-05 22:13:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 22:13:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 22:13:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 22:13:58,692 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 22:13:58,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 22:13:58,951 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-05 22:13:58,952 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 22:13:58,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 22:13:58,968 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 22:13:58,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:13:58 BoogieIcfgContainer [2024-11-05 22:13:58,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 22:13:58,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 22:13:58,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 22:13:58,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 22:13:58,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 10:13:58" (1/3) ... [2024-11-05 22:13:58,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb23e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:13:58, skipping insertion in model container [2024-11-05 22:13:58,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:13:58" (2/3) ... [2024-11-05 22:13:58,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb23e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:13:58, skipping insertion in model container [2024-11-05 22:13:58,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:13:58" (3/3) ... [2024-11-05 22:13:58,982 INFO L112 eAbstractionObserver]: Analyzing ICFG color-magicseries1.c [2024-11-05 22:13:58,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 22:13:58,994 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 22:13:59,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 22:13:59,068 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;@180b354d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 22:13:59,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 22:13:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 22:13:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 22:13:59,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:13:59,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:13:59,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:13:59,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:13:59,082 INFO L85 PathProgramCache]: Analyzing trace with hash -173200605, now seen corresponding path program 1 times [2024-11-05 22:13:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:13:59,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1270299050] [2024-11-05 22:13:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:13:59,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 22:13:59,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:13:59,093 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 22:13:59,095 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 22:13:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:13:59,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:13:59,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:13:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:13:59,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:13:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:13:59,329 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:13:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1270299050] [2024-11-05 22:13:59,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1270299050] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:13:59,330 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:13:59,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 22:13:59,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011383441] [2024-11-05 22:13:59,332 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:13:59,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 22:13:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:13:59,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 22:13:59,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:13:59,364 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 22:13:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:13:59,438 INFO L93 Difference]: Finished difference Result 73 states and 104 transitions. [2024-11-05 22:13:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 22:13:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-05 22:13:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:13:59,449 INFO L225 Difference]: With dead ends: 73 [2024-11-05 22:13:59,449 INFO L226 Difference]: Without dead ends: 38 [2024-11-05 22:13:59,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:13:59,454 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:13:59,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:13:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-05 22:13:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-05 22:13:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 22:13:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-05 22:13:59,492 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 17 [2024-11-05 22:13:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:13:59,493 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-05 22:13:59,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 22:13:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-05 22:13:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 22:13:59,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:13:59,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:13:59,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 22:13:59,699 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 22:13:59,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:13:59,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:13:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -466603612, now seen corresponding path program 1 times [2024-11-05 22:13:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:13:59,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839058145] [2024-11-05 22:13:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:13:59,701 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 22:13:59,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:13:59,705 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 22:13:59,708 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 22:13:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:13:59,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 22:13:59,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:13:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:13:59,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:13:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:13:59,838 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:13:59,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839058145] [2024-11-05 22:13:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1839058145] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:13:59,838 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:13:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2024-11-05 22:13:59,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816534649] [2024-11-05 22:13:59,839 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:13:59,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 22:13:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:13:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 22:13:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-05 22:13:59,843 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 22:13:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:13:59,869 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-11-05 22:13:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:13:59,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-05 22:13:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:13:59,872 INFO L225 Difference]: With dead ends: 42 [2024-11-05 22:13:59,872 INFO L226 Difference]: Without dead ends: 38 [2024-11-05 22:13:59,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-05 22:13:59,873 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:13:59,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:13:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-05 22:13:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-05 22:13:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 22:13:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-05 22:13:59,880 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 17 [2024-11-05 22:13:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:13:59,880 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-05 22:13:59,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 22:13:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-05 22:13:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-05 22:13:59,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:13:59,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:13:59,886 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 22:14:00,082 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 22:14:00,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:00,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash -97449680, now seen corresponding path program 1 times [2024-11-05 22:14:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:00,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364317199] [2024-11-05 22:14:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:00,084 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 22:14:00,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:00,087 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 22:14:00,088 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 22:14:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:00,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 22:14:00,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:14:00,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:14:00,260 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:00,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364317199] [2024-11-05 22:14:00,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [364317199] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:00,261 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:00,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2024-11-05 22:14:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103527043] [2024-11-05 22:14:00,261 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:00,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 22:14:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 22:14:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:14:00,262 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 22:14:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:00,336 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-11-05 22:14:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 22:14:00,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-05 22:14:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:00,338 INFO L225 Difference]: With dead ends: 74 [2024-11-05 22:14:00,338 INFO L226 Difference]: Without dead ends: 36 [2024-11-05 22:14:00,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:14:00,340 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:00,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 22:14:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-05 22:14:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-05 22:14:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-05 22:14:00,347 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 21 [2024-11-05 22:14:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:00,347 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-05 22:14:00,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 22:14:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-05 22:14:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 22:14:00,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:00,349 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:00,353 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 22:14:00,549 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 22:14:00,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:00,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1645112148, now seen corresponding path program 1 times [2024-11-05 22:14:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:00,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99724699] [2024-11-05 22:14:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:00,551 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 22:14:00,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:00,554 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 22:14:00,555 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 22:14:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:00,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 22:14:00,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:00,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:00,650 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:00,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99724699] [2024-11-05 22:14:00,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [99724699] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:00,650 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:00,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 22:14:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292535255] [2024-11-05 22:14:00,651 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:00,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 22:14:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 22:14:00,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:00,652 INFO L87 Difference]: Start difference. First operand 36 states and 45 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:00,678 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-05 22:14:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:14:00,679 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-05 22:14:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:00,680 INFO L225 Difference]: With dead ends: 53 [2024-11-05 22:14:00,680 INFO L226 Difference]: Without dead ends: 46 [2024-11-05 22:14:00,680 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 22:14:00,681 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:00,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-05 22:14:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-11-05 22:14:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2024-11-05 22:14:00,689 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 39 [2024-11-05 22:14:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:00,690 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2024-11-05 22:14:00,690 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2024-11-05 22:14:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 22:14:00,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:00,691 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:00,697 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 22:14:00,895 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 22:14:00,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:00,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1930899933, now seen corresponding path program 1 times [2024-11-05 22:14:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323275819] [2024-11-05 22:14:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:00,896 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 22:14:00,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:00,898 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 22:14:00,900 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 22:14:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:00,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 22:14:00,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:00,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:01,012 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323275819] [2024-11-05 22:14:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1323275819] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:01,012 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 22:14:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654318257] [2024-11-05 22:14:01,012 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 22:14:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 22:14:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:01,015 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:01,050 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2024-11-05 22:14:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:14:01,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-05 22:14:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:01,053 INFO L225 Difference]: With dead ends: 70 [2024-11-05 22:14:01,054 INFO L226 Difference]: Without dead ends: 52 [2024-11-05 22:14:01,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 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 22:14:01,055 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:01,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 105 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-05 22:14:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-05 22:14:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 46 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2024-11-05 22:14:01,070 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 41 [2024-11-05 22:14:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:01,071 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2024-11-05 22:14:01,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2024-11-05 22:14:01,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-05 22:14:01,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:01,072 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:01,077 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 22:14:01,273 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 22:14:01,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1729819971, now seen corresponding path program 1 times [2024-11-05 22:14:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041912440] [2024-11-05 22:14:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:01,275 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 22:14:01,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:01,278 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 22:14:01,279 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 22:14:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:01,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:14:01,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:01,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:01,482 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041912440] [2024-11-05 22:14:01,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1041912440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:01,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:01,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 22:14:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262280404] [2024-11-05 22:14:01,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:01,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 22:14:01,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:01,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 22:14:01,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 22:14:01,485 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:01,541 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2024-11-05 22:14:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 22:14:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2024-11-05 22:14:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:01,551 INFO L225 Difference]: With dead ends: 86 [2024-11-05 22:14:01,551 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 22:14:01,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 22:14:01,552 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 15 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:01,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 151 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 22:14:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-05 22:14:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 58 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-11-05 22:14:01,565 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 47 [2024-11-05 22:14:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:01,566 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-11-05 22:14:01,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-11-05 22:14:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-05 22:14:01,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:01,570 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:01,575 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 22:14:01,770 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 22:14:01,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash 60507235, now seen corresponding path program 2 times [2024-11-05 22:14:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918511084] [2024-11-05 22:14:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:01,772 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 22:14:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:01,775 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 22:14:01,776 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 22:14:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:01,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 22:14:01,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-05 22:14:01,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-05 22:14:01,889 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:01,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918511084] [2024-11-05 22:14:01,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1918511084] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:01,889 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:01,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-05 22:14:01,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109241520] [2024-11-05 22:14:01,890 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:01,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 22:14:01,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:01,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 22:14:01,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:01,891 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:01,907 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-11-05 22:14:01,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:14:01,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2024-11-05 22:14:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:01,909 INFO L225 Difference]: With dead ends: 70 [2024-11-05 22:14:01,909 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 22:14:01,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:01,910 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:01,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 22:14:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-05 22:14:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 58 states have internal predecessors, (69), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-11-05 22:14:01,923 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 53 [2024-11-05 22:14:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:01,923 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-11-05 22:14:01,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-11-05 22:14:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 22:14:01,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:01,925 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:01,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-05 22:14:02,126 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 22:14:02,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:02,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1455445076, now seen corresponding path program 1 times [2024-11-05 22:14:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:02,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1683333634] [2024-11-05 22:14:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 22:14:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:02,130 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 22:14:02,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 22:14:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:02,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 22:14:02,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-05 22:14:02,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:02,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:02,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-05 22:14:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-05 22:14:02,825 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:02,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1683333634] [2024-11-05 22:14:02,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1683333634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:02,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:02,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-05 22:14:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247339580] [2024-11-05 22:14:02,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:02,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 22:14:02,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 22:14:02,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-05 22:14:02,827 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:38,439 INFO L93 Difference]: Finished difference Result 154 states and 196 transitions. [2024-11-05 22:14:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 22:14:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-05 22:14:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:38,441 INFO L225 Difference]: With dead ends: 154 [2024-11-05 22:14:38,441 INFO L226 Difference]: Without dead ends: 110 [2024-11-05 22:14:38,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=308, Invalid=874, Unknown=8, NotChecked=0, Total=1190 [2024-11-05 22:14:38,443 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 87 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:38,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 435 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 22:14:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-05 22:14:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2024-11-05 22:14:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.25) internal successors, (105), 85 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2024-11-05 22:14:38,460 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 73 [2024-11-05 22:14:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:38,460 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2024-11-05 22:14:38,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2024-11-05 22:14:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 22:14:38,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:38,462 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:38,470 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 22:14:38,662 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 22:14:38,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:38,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash 994155054, now seen corresponding path program 1 times [2024-11-05 22:14:38,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:38,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [484152758] [2024-11-05 22:14:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:38,664 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 22:14:38,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:38,665 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 22:14:38,666 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 22:14:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:38,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 22:14:38,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 22:14:38,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:39,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:39,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-05 22:14:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 22:14:39,319 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:39,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [484152758] [2024-11-05 22:14:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [484152758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:39,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-11-05 22:14:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603981403] [2024-11-05 22:14:39,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:39,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-05 22:14:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:39,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-05 22:14:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2024-11-05 22:14:39,322 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:39,879 INFO L93 Difference]: Finished difference Result 192 states and 248 transitions. [2024-11-05 22:14:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 22:14:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-05 22:14:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:39,881 INFO L225 Difference]: With dead ends: 192 [2024-11-05 22:14:39,881 INFO L226 Difference]: Without dead ends: 168 [2024-11-05 22:14:39,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2024-11-05 22:14:39,883 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 161 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:39,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 285 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 22:14:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-05 22:14:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 144. [2024-11-05 22:14:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 138 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2024-11-05 22:14:39,910 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 73 [2024-11-05 22:14:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:39,910 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2024-11-05 22:14:39,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2024-11-05 22:14:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 22:14:39,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:39,911 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:39,916 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 22:14:40,112 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 22:14:40,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:40,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1213009772, now seen corresponding path program 2 times [2024-11-05 22:14:40,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:40,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384608294] [2024-11-05 22:14:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:40,113 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 22:14:40,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:40,114 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 22:14:40,115 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 22:14:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:40,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 22:14:40,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 53 proven. 40 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-05 22:14:40,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:40,656 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-05 22:14:40,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2024-11-05 22:14:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 57 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-05 22:14:40,720 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384608294] [2024-11-05 22:14:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [384608294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:40,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-11-05 22:14:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425916565] [2024-11-05 22:14:40,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:40,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 22:14:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:40,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 22:14:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-05 22:14:40,723 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:41,307 INFO L93 Difference]: Finished difference Result 342 states and 449 transitions. [2024-11-05 22:14:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-05 22:14:41,307 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-05 22:14:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:41,308 INFO L225 Difference]: With dead ends: 342 [2024-11-05 22:14:41,308 INFO L226 Difference]: Without dead ends: 304 [2024-11-05 22:14:41,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2024-11-05 22:14:41,310 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 89 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:41,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 347 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 22:14:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-05 22:14:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 280. [2024-11-05 22:14:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 273 states have (on average 1.3076923076923077) internal successors, (357), 274 states have internal predecessors, (357), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 368 transitions. [2024-11-05 22:14:41,335 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 368 transitions. Word has length 73 [2024-11-05 22:14:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:41,335 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 368 transitions. [2024-11-05 22:14:41,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 368 transitions. [2024-11-05 22:14:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 22:14:41,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:41,337 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:41,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 (11)] Forceful destruction successful, exit code 0 [2024-11-05 22:14:41,537 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 22:14:41,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:41,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -475933970, now seen corresponding path program 3 times [2024-11-05 22:14:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:41,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1911352139] [2024-11-05 22:14:41,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:41,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 22:14:41,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:41,541 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 22:14:41,542 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 22:14:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:41,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 22:14:41,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 63 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 22:14:41,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:42,097 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-05 22:14:42,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2024-11-05 22:14:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 43 proven. 60 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 22:14:42,193 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:42,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1911352139] [2024-11-05 22:14:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1911352139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:42,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:42,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2024-11-05 22:14:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65345869] [2024-11-05 22:14:42,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:42,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-05 22:14:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-05 22:14:42,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-05 22:14:42,195 INFO L87 Difference]: Start difference. First operand 280 states and 368 transitions. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:43,107 INFO L93 Difference]: Finished difference Result 723 states and 945 transitions. [2024-11-05 22:14:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-05 22:14:43,108 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-05 22:14:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:43,110 INFO L225 Difference]: With dead ends: 723 [2024-11-05 22:14:43,110 INFO L226 Difference]: Without dead ends: 635 [2024-11-05 22:14:43,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2024-11-05 22:14:43,112 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 109 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:43,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 471 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 22:14:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-05 22:14:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 598. [2024-11-05 22:14:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 591 states have (on average 1.299492385786802) internal successors, (768), 592 states have internal predecessors, (768), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 779 transitions. [2024-11-05 22:14:43,158 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 779 transitions. Word has length 73 [2024-11-05 22:14:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:43,158 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 779 transitions. [2024-11-05 22:14:43,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 779 transitions. [2024-11-05 22:14:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 22:14:43,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:43,160 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:43,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-05 22:14:43,360 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 22:14:43,361 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:43,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1497002324, now seen corresponding path program 4 times [2024-11-05 22:14:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:43,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064157948] [2024-11-05 22:14:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:43,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 22:14:43,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:43,366 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 22:14:43,367 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 22:14:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:43,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 22:14:43,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 21 proven. 86 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:43,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:44,063 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-05 22:14:44,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2024-11-05 22:14:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 23 proven. 84 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:44,194 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:44,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064157948] [2024-11-05 22:14:44,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1064157948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:44,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-11-05 22:14:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777828486] [2024-11-05 22:14:44,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:44,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-05 22:14:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-05 22:14:44,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-11-05 22:14:44,196 INFO L87 Difference]: Start difference. First operand 598 states and 779 transitions. Second operand has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:45,197 INFO L93 Difference]: Finished difference Result 1762 states and 2308 transitions. [2024-11-05 22:14:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-05 22:14:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-05 22:14:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:45,204 INFO L225 Difference]: With dead ends: 1762 [2024-11-05 22:14:45,204 INFO L226 Difference]: Without dead ends: 1540 [2024-11-05 22:14:45,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2024-11-05 22:14:45,205 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 137 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:45,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 467 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 22:14:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-05 22:14:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1414. [2024-11-05 22:14:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1407 states have (on average 1.3077469793887704) internal successors, (1840), 1408 states have internal predecessors, (1840), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1851 transitions. [2024-11-05 22:14:45,351 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1851 transitions. Word has length 73 [2024-11-05 22:14:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:45,351 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 1851 transitions. [2024-11-05 22:14:45,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1851 transitions. [2024-11-05 22:14:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 22:14:45,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:45,354 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:45,360 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 22:14:45,558 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 22:14:45,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:45,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2083808338, now seen corresponding path program 5 times [2024-11-05 22:14:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088300553] [2024-11-05 22:14:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:45,559 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 22:14:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:45,561 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 22:14:45,563 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 22:14:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:45,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:14:45,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-05 22:14:45,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-05 22:14:45,774 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088300553] [2024-11-05 22:14:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2088300553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:45,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:45,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 22:14:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340942468] [2024-11-05 22:14:45,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:45,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 22:14:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 22:14:45,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 22:14:45,776 INFO L87 Difference]: Start difference. First operand 1414 states and 1851 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:45,979 INFO L93 Difference]: Finished difference Result 1646 states and 2158 transitions. [2024-11-05 22:14:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 22:14:45,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-05 22:14:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:45,986 INFO L225 Difference]: With dead ends: 1646 [2024-11-05 22:14:45,987 INFO L226 Difference]: Without dead ends: 1639 [2024-11-05 22:14:45,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 22:14:45,989 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:45,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 237 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 22:14:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-05 22:14:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2024-11-05 22:14:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1632 states have (on average 1.2738970588235294) internal successors, (2079), 1633 states have internal predecessors, (2079), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2090 transitions. [2024-11-05 22:14:46,151 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2090 transitions. Word has length 73 [2024-11-05 22:14:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:46,151 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2090 transitions. [2024-11-05 22:14:46,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2090 transitions. [2024-11-05 22:14:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 22:14:46,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:46,155 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:46,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-05 22:14:46,355 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 22:14:46,355 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:46,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:46,356 INFO L85 PathProgramCache]: Analyzing trace with hash 110177520, now seen corresponding path program 6 times [2024-11-05 22:14:46,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:46,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1426491810] [2024-11-05 22:14:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:46,356 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 22:14:46,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:46,357 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 22:14:46,359 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 22:14:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:46,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 22:14:46,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 7 proven. 392 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-05 22:14:46,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:47,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:47,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2024-11-05 22:14:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 7 proven. 392 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-05 22:14:47,359 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:47,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1426491810] [2024-11-05 22:14:47,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1426491810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:47,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:47,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-05 22:14:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612074388] [2024-11-05 22:14:47,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:47,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-05 22:14:47,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:47,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-05 22:14:47,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2024-11-05 22:14:47,361 INFO L87 Difference]: Start difference. First operand 1639 states and 2090 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:50,402 INFO L93 Difference]: Finished difference Result 1998 states and 2544 transitions. [2024-11-05 22:14:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-05 22:14:50,402 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-05 22:14:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:50,409 INFO L225 Difference]: With dead ends: 1998 [2024-11-05 22:14:50,409 INFO L226 Difference]: Without dead ends: 1825 [2024-11-05 22:14:50,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2024-11-05 22:14:50,410 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:50,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 705 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 22:14:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-05 22:14:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1783. [2024-11-05 22:14:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1776 states have (on average 1.2702702702702702) internal successors, (2256), 1777 states have internal predecessors, (2256), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2267 transitions. [2024-11-05 22:14:50,588 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2267 transitions. Word has length 107 [2024-11-05 22:14:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:50,589 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2267 transitions. [2024-11-05 22:14:50,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2267 transitions. [2024-11-05 22:14:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 22:14:50,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:50,592 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 13, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:50,600 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 (15)] Forceful destruction successful, exit code 0 [2024-11-05 22:14:50,793 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 22:14:50,793 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:50,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:50,793 INFO L85 PathProgramCache]: Analyzing trace with hash 329032238, now seen corresponding path program 7 times [2024-11-05 22:14:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:50,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [552311259] [2024-11-05 22:14:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:50,794 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 22:14:50,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:50,797 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 22:14:50,798 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 22:14:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:50,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 22:14:50,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 164 proven. 233 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-05 22:14:51,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:51,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:51,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2024-11-05 22:14:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 164 proven. 233 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-05 22:14:51,478 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [552311259] [2024-11-05 22:14:51,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [552311259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:51,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-05 22:14:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014211236] [2024-11-05 22:14:51,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:51,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-05 22:14:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:51,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-05 22:14:51,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-05 22:14:51,480 INFO L87 Difference]: Start difference. First operand 1783 states and 2267 transitions. Second operand has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:51,940 INFO L93 Difference]: Finished difference Result 2487 states and 3126 transitions. [2024-11-05 22:14:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 22:14:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-05 22:14:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:51,946 INFO L225 Difference]: With dead ends: 2487 [2024-11-05 22:14:51,946 INFO L226 Difference]: Without dead ends: 2264 [2024-11-05 22:14:51,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2024-11-05 22:14:51,948 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:51,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 606 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 22:14:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-11-05 22:14:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2062. [2024-11-05 22:14:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 2055 states have (on average 1.2545012165450122) internal successors, (2578), 2056 states have internal predecessors, (2578), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2589 transitions. [2024-11-05 22:14:52,174 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2589 transitions. Word has length 107 [2024-11-05 22:14:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:52,174 INFO L471 AbstractCegarLoop]: Abstraction has 2062 states and 2589 transitions. [2024-11-05 22:14:52,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2589 transitions. [2024-11-05 22:14:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 22:14:52,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:52,180 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:52,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-05 22:14:52,380 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 22:14:52,380 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:52,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1453921112, now seen corresponding path program 8 times [2024-11-05 22:14:52,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1775672583] [2024-11-05 22:14:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:52,381 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 22:14:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:52,382 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 22:14:52,383 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 22:14:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:52,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-05 22:14:52,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 82 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-05 22:14:52,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:52,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:52,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2024-11-05 22:14:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 247 proven. 80 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-05 22:14:52,940 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1775672583] [2024-11-05 22:14:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1775672583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:52,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-05 22:14:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147229390] [2024-11-05 22:14:52,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:52,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-05 22:14:52,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:52,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-05 22:14:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-11-05 22:14:52,942 INFO L87 Difference]: Start difference. First operand 2062 states and 2589 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:53,388 INFO L93 Difference]: Finished difference Result 2928 states and 3678 transitions. [2024-11-05 22:14:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 22:14:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-05 22:14:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:53,396 INFO L225 Difference]: With dead ends: 2928 [2024-11-05 22:14:53,396 INFO L226 Difference]: Without dead ends: 2300 [2024-11-05 22:14:53,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2024-11-05 22:14:53,398 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 84 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:53,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 351 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 22:14:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2024-11-05 22:14:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2284. [2024-11-05 22:14:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2277 states have (on average 1.261747913921827) internal successors, (2873), 2278 states have internal predecessors, (2873), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 2884 transitions. [2024-11-05 22:14:53,607 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 2884 transitions. Word has length 107 [2024-11-05 22:14:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:53,607 INFO L471 AbstractCegarLoop]: Abstraction has 2284 states and 2884 transitions. [2024-11-05 22:14:53,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2884 transitions. [2024-11-05 22:14:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 22:14:53,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:53,612 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 11, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:53,618 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 (17)] Ended with exit code 0 [2024-11-05 22:14:53,813 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 22:14:53,813 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:53,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1878519534, now seen corresponding path program 9 times [2024-11-05 22:14:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565708725] [2024-11-05 22:14:53,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:53,814 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 22:14:53,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:53,815 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 22:14:53,815 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 22:14:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:53,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 22:14:53,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 187 proven. 214 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-05 22:14:54,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:54,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:54,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2024-11-05 22:14:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 188 proven. 213 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-05 22:14:54,619 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:54,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565708725] [2024-11-05 22:14:54,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1565708725] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:54,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:54,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-05 22:14:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660414797] [2024-11-05 22:14:54,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:54,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-05 22:14:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-05 22:14:54,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2024-11-05 22:14:54,621 INFO L87 Difference]: Start difference. First operand 2284 states and 2884 transitions. Second operand has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 states have internal predecessors, (102), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:55,450 INFO L93 Difference]: Finished difference Result 3079 states and 3905 transitions. [2024-11-05 22:14:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-05 22:14:55,450 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 states have internal predecessors, (102), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-05 22:14:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:55,458 INFO L225 Difference]: With dead ends: 3079 [2024-11-05 22:14:55,458 INFO L226 Difference]: Without dead ends: 2711 [2024-11-05 22:14:55,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2024-11-05 22:14:55,459 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 91 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:55,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 654 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 22:14:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2024-11-05 22:14:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2623. [2024-11-05 22:14:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2616 states have (on average 1.261085626911315) internal successors, (3299), 2617 states have internal predecessors, (3299), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 3310 transitions. [2024-11-05 22:14:55,716 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 3310 transitions. Word has length 107 [2024-11-05 22:14:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:55,716 INFO L471 AbstractCegarLoop]: Abstraction has 2623 states and 3310 transitions. [2024-11-05 22:14:55,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 states have internal predecessors, (102), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3310 transitions. [2024-11-05 22:14:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 22:14:55,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:55,721 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:55,729 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 (18)] Ended with exit code 0 [2024-11-05 22:14:55,921 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 22:14:55,922 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:55,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 642590636, now seen corresponding path program 10 times [2024-11-05 22:14:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:55,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [42646083] [2024-11-05 22:14:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:55,923 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 22:14:55,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:55,924 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 22:14:55,925 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 22:14:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:56,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 22:14:56,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 244 proven. 99 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-05 22:14:56,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:56,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:56,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2024-11-05 22:14:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 244 proven. 99 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-05 22:14:56,490 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [42646083] [2024-11-05 22:14:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [42646083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:56,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-05 22:14:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112535037] [2024-11-05 22:14:56,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-05 22:14:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-05 22:14:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-11-05 22:14:56,492 INFO L87 Difference]: Start difference. First operand 2623 states and 3310 transitions. Second operand has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:56,987 INFO L93 Difference]: Finished difference Result 4089 states and 5125 transitions. [2024-11-05 22:14:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 22:14:56,987 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-05 22:14:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:56,997 INFO L225 Difference]: With dead ends: 4089 [2024-11-05 22:14:56,997 INFO L226 Difference]: Without dead ends: 3441 [2024-11-05 22:14:56,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-05 22:14:56,999 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:56,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 563 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 22:14:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2024-11-05 22:14:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3082. [2024-11-05 22:14:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 3075 states have (on average 1.2546341463414634) internal successors, (3858), 3076 states have internal predecessors, (3858), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 3869 transitions. [2024-11-05 22:14:57,279 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 3869 transitions. Word has length 107 [2024-11-05 22:14:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:57,280 INFO L471 AbstractCegarLoop]: Abstraction has 3082 states and 3869 transitions. [2024-11-05 22:14:57,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 3869 transitions. [2024-11-05 22:14:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 22:14:57,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:57,285 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:57,292 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 (19)] Ended with exit code 0 [2024-11-05 22:14:57,486 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 22:14:57,486 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:57,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1030632236, now seen corresponding path program 11 times [2024-11-05 22:14:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:57,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626819427] [2024-11-05 22:14:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:57,487 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 22:14:57,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:57,488 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 22:14:57,489 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 22:14:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 22:14:57,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 22:14:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 22:14:57,769 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 22:14:57,769 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 22:14:57,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 22:14:57,780 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 22:14:57,972 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 22:14:57,975 INFO L407 BasicCegarLoop]: Path program histogram: [11, 2, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:58,030 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 22:14:58,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 10:14:58 BoogieIcfgContainer [2024-11-05 22:14:58,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 22:14:58,035 INFO L158 Benchmark]: Toolchain (without parser) took 59832.30ms. Allocated memory was 305.1MB in the beginning and 440.4MB in the end (delta: 135.3MB). Free memory was 248.2MB in the beginning and 364.2MB in the end (delta: -116.0MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2024-11-05 22:14:58,035 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 150.0MB in the beginning and 149.9MB in the end (delta: 71.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 22:14:58,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.99ms. Allocated memory is still 305.1MB. Free memory was 247.9MB in the beginning and 234.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-05 22:14:58,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.95ms. Allocated memory is still 305.1MB. Free memory was 234.6MB in the beginning and 233.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-05 22:14:58,036 INFO L158 Benchmark]: Boogie Preprocessor took 45.37ms. Allocated memory is still 305.1MB. Free memory was 233.1MB in the beginning and 230.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 22:14:58,036 INFO L158 Benchmark]: RCFGBuilder took 433.84ms. Allocated memory is still 305.1MB. Free memory was 230.7MB in the beginning and 214.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-05 22:14:58,036 INFO L158 Benchmark]: TraceAbstraction took 59059.52ms. Allocated memory was 305.1MB in the beginning and 440.4MB in the end (delta: 135.3MB). Free memory was 214.0MB in the beginning and 364.2MB in the end (delta: -150.2MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 22:14:58,037 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 150.0MB in the beginning and 149.9MB in the end (delta: 71.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.99ms. Allocated memory is still 305.1MB. Free memory was 247.9MB in the beginning and 234.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.95ms. Allocated memory is still 305.1MB. Free memory was 234.6MB in the beginning and 233.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.37ms. Allocated memory is still 305.1MB. Free memory was 233.1MB in the beginning and 230.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 433.84ms. Allocated memory is still 305.1MB. Free memory was 230.7MB in the beginning and 214.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 59059.52ms. Allocated memory was 305.1MB in the beginning and 440.4MB in the end (delta: 135.3MB). Free memory was 214.0MB in the beginning and 364.2MB in the end (delta: -150.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L56] int x, y, z, w; [L57] x = __VERIFIER_nondet_int() [L58] y = __VERIFIER_nondet_int() [L59] z = __VERIFIER_nondet_int() [L60] w = __VERIFIER_nondet_int() [L61] CALL, EXPR solve(x, y, z, w) [L44] CALL, EXPR check_domain(s0) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=2, \result=1] [L44] RET, EXPR check_domain(s0) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s1) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=0, \result=1] [L44] RET, EXPR check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s2) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=2, \result=1] [L44] RET, EXPR check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L45] CALL, EXPR check_domain(s3) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=0, \result=1] [L45] RET, EXPR check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] COND TRUE check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) [L46] CALL check_sum(s0, s1, s2, s3) [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L34] int i = 0; VAL [i=0, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=0, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=1, s={5:0}, sum=1] [L36] j++ VAL [i=0, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=3, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=3, s={5:0}, sum=2] [L36] j++ VAL [i=0, j=4, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=0, s={5:0}, sum=2] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=1, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=1, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=4, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=1, s={5:0}, sum=0] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=2, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=2, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=0, s={5:0}, sum=1] [L36] j++ VAL [i=2, j=1, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=2, s={5:0}, sum=2] [L36] j++ VAL [i=2, j=3, s={5:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=4, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=2, s={5:0}, sum=2] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=3, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=3, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=4, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=3, s={5:0}, sum=0] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=4, s={5:0}] [L34] COND FALSE !(i < 4) VAL [s={5:0}] [L40] return 1; [L33] int s[4] = {s0, s1, s2, s3}; [L40] return 1; VAL [\result=1] [L46] RET check_sum(s0, s1, s2, s3) [L46] COND TRUE check_sum(s0, s1, s2, s3) [L47] return 1; VAL [\result=1] [L61] RET, EXPR solve(x, y, z, w) [L61] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.9s, OverallIterations: 19, TraceHistogramMax: 16, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 44.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 972 mSDsluCounter, 6242 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5496 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5704 IncrementalHoareTripleChecker+Invalid, 5735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 746 mSDtfsCounter, 5704 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2484 GetRequests, 2140 SyntacticMatches, 0 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 42.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=18, InterpolantAutomatonStates: 270, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 939 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1315 NumberOfCodeBlocks, 1315 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2380 ConstructedInterpolants, 0 QuantifiedInterpolants, 9964 SizeOfPredicates, 80 NumberOfNonLiveVariables, 2533 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 36 InterpolantComputations, 12 PerfectInterpolantSequences, 3992/6638 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-05 22:14:58,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...