/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 01:53:08,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 01:53:08,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 01:53:08,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 01:53:08,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 01:53:08,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 01:53:08,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 01:53:08,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 01:53:08,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 01:53:08,354 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 01:53:08,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 01:53:08,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 01:53:08,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 01:53:08,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 01:53:08,356 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 01:53:08,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 01:53:08,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 01:53:08,357 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 01:53:08,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 01:53:08,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 01:53:08,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 01:53:08,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 01:53:08,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 01:53:08,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 01:53:08,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 01:53:08,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 01:53:08,363 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 01:53:08,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 01:53:08,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 01:53:08,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 01:53:08,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 01:53:08,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 01:53:08,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 01:53:08,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 01:53:08,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:53:08,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 01:53:08,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 01:53:08,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 01:53:08,366 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 01:53:08,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 01:53:08,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 01:53:08,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 01:53:08,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 01:53:08,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 01:53:08,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 01:53:08,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 01:53:08,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 01:53:08,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 01:53:08,617 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 01:53:08,618 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 01:53:08,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c [2024-11-06 01:53:10,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 01:53:10,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 01:53:10,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c [2024-11-06 01:53:10,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3a95aae/c91d2c87e71841f9a23d2b1f908548fb/FLAG171bcf195 [2024-11-06 01:53:10,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3a95aae/c91d2c87e71841f9a23d2b1f908548fb [2024-11-06 01:53:10,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 01:53:10,633 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 01:53:10,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 01:53:10,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 01:53:10,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 01:53:10,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59119667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10, skipping insertion in model container [2024-11-06 01:53:10,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 01:53:10,828 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-sendmoremoney.c[614,627] [2024-11-06 01:53:10,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:53:10,865 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 01:53:10,876 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-sendmoremoney.c[614,627] [2024-11-06 01:53:10,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:53:10,907 INFO L204 MainTranslator]: Completed translation [2024-11-06 01:53:10,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10 WrapperNode [2024-11-06 01:53:10,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 01:53:10,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 01:53:10,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 01:53:10,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 01:53:10,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,944 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2024-11-06 01:53:10,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 01:53:10,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 01:53:10,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 01:53:10,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 01:53:10,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,971 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-06 01:53:10,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 01:53:10,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 01:53:10,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 01:53:10,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 01:53:10,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (1/1) ... [2024-11-06 01:53:10,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:53:11,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 01:53:11,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 01:53:11,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 01:53:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 01:53:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 01:53:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 01:53:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-06 01:53:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-06 01:53:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 01:53:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-06 01:53:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-06 01:53:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 01:53:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 01:53:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-06 01:53:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-06 01:53:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-06 01:53:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-06 01:53:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 01:53:11,128 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 01:53:11,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 01:53:11,460 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-06 01:53:11,460 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 01:53:11,477 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 01:53:11,477 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 01:53:11,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:53:11 BoogieIcfgContainer [2024-11-06 01:53:11,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 01:53:11,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 01:53:11,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 01:53:11,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 01:53:11,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 01:53:10" (1/3) ... [2024-11-06 01:53:11,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3303c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:53:11, skipping insertion in model container [2024-11-06 01:53:11,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:10" (2/3) ... [2024-11-06 01:53:11,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3303c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:53:11, skipping insertion in model container [2024-11-06 01:53:11,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:53:11" (3/3) ... [2024-11-06 01:53:11,492 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-06 01:53:11,505 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 01:53:11,505 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 01:53:11,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 01:53:11,562 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;@26ebf8f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 01:53:11,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 01:53:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 01:53:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 01:53:11,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:11,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:11,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:11,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash -871385011, now seen corresponding path program 1 times [2024-11-06 01:53:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:11,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011666936] [2024-11-06 01:53:11,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:11,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:11,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:53:11,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 01:53:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:11,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:53:11,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 01:53:11,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:11,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:11,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011666936] [2024-11-06 01:53:11,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011666936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:11,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:11,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 01:53:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016082602] [2024-11-06 01:53:11,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:11,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 01:53:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:11,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 01:53:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 01:53:11,863 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-06 01:53:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:11,938 INFO L93 Difference]: Finished difference Result 113 states and 156 transitions. [2024-11-06 01:53:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 01:53:11,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2024-11-06 01:53:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:11,951 INFO L225 Difference]: With dead ends: 113 [2024-11-06 01:53:11,951 INFO L226 Difference]: Without dead ends: 58 [2024-11-06 01:53:11,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 01:53:11,960 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:11,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-06 01:53:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-06 01:53:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-06 01:53:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-06 01:53:12,010 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 27 [2024-11-06 01:53:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:12,011 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-06 01:53:12,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-06 01:53:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-06 01:53:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 01:53:12,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:12,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:12,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-06 01:53:12,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:12,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:12,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash 373379470, now seen corresponding path program 1 times [2024-11-06 01:53:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162139960] [2024-11-06 01:53:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:12,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:12,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:12,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:53:12,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 01:53:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:12,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 01:53:12,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 01:53:12,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:12,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:12,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162139960] [2024-11-06 01:53:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162139960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:12,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:12,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 01:53:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298226767] [2024-11-06 01:53:12,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:12,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 01:53:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 01:53:12,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 01:53:12,363 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-06 01:53:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:12,395 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-06 01:53:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 01:53:12,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2024-11-06 01:53:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:12,397 INFO L225 Difference]: With dead ends: 62 [2024-11-06 01:53:12,398 INFO L226 Difference]: Without dead ends: 58 [2024-11-06 01:53:12,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-06 01:53:12,399 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:12,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-06 01:53:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-06 01:53:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-06 01:53:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-06 01:53:12,411 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 27 [2024-11-06 01:53:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:12,412 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-06 01:53:12,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-06 01:53:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-06 01:53:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 01:53:12,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:12,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:12,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-06 01:53:12,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:12,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:12,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash 373319888, now seen corresponding path program 1 times [2024-11-06 01:53:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123342326] [2024-11-06 01:53:12,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:12,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:12,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:12,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:53:12,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 01:53:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:12,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 01:53:12,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 01:53:12,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:12,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123342326] [2024-11-06 01:53:12,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123342326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:12,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:12,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 01:53:12,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584658007] [2024-11-06 01:53:12,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:12,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 01:53:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:12,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 01:53:12,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-06 01:53:12,850 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-06 01:53:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:13,095 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2024-11-06 01:53:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 01:53:13,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 27 [2024-11-06 01:53:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:13,097 INFO L225 Difference]: With dead ends: 124 [2024-11-06 01:53:13,097 INFO L226 Difference]: Without dead ends: 56 [2024-11-06 01:53:13,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-06 01:53:13,100 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:13,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 01:53:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-06 01:53:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-06 01:53:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 45 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-11-06 01:53:13,112 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 27 [2024-11-06 01:53:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:13,113 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-11-06 01:53:13,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-06 01:53:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-06 01:53:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-06 01:53:13,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:13,115 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:13,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-06 01:53:13,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:13,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:13,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash 761216169, now seen corresponding path program 1 times [2024-11-06 01:53:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:13,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058008578] [2024-11-06 01:53:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:13,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:13,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:13,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:53:13,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 01:53:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:13,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 01:53:13,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 01:53:13,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:13,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:13,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058008578] [2024-11-06 01:53:13,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058008578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:13,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:13,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 01:53:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133107245] [2024-11-06 01:53:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:13,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 01:53:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 01:53:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:53:13,488 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:13,518 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2024-11-06 01:53:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 01:53:13,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-11-06 01:53:13,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:13,521 INFO L225 Difference]: With dead ends: 70 [2024-11-06 01:53:13,521 INFO L226 Difference]: Without dead ends: 63 [2024-11-06 01:53:13,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:53:13,523 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:13,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 118 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-06 01:53:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2024-11-06 01:53:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-11-06 01:53:13,538 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 72 [2024-11-06 01:53:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:13,539 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-11-06 01:53:13,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-06 01:53:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-06 01:53:13,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:13,543 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:13,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 01:53:13,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:13,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:13,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1352872087, now seen corresponding path program 1 times [2024-11-06 01:53:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:13,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70271754] [2024-11-06 01:53:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:13,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:13,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:53:13,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 01:53:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:13,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:53:13,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 01:53:13,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:13,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70271754] [2024-11-06 01:53:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70271754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:13,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:13,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 01:53:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095007573] [2024-11-06 01:53:13,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:13,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 01:53:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 01:53:13,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 01:53:13,914 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:13,958 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-11-06 01:53:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 01:53:13,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-06 01:53:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:13,960 INFO L225 Difference]: With dead ends: 63 [2024-11-06 01:53:13,960 INFO L226 Difference]: Without dead ends: 57 [2024-11-06 01:53:13,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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-06 01:53:13,962 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:13,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-06 01:53:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-06 01:53:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-11-06 01:53:13,974 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 73 [2024-11-06 01:53:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:13,975 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-06 01:53:13,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-06 01:53:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-06 01:53:13,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:13,976 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:13,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-06 01:53:14,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:14,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 453527745, now seen corresponding path program 1 times [2024-11-06 01:53:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:14,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870171062] [2024-11-06 01:53:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:14,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:14,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:14,184 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:53:14,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 01:53:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:14,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 01:53:14,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 01:53:14,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:14,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870171062] [2024-11-06 01:53:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870171062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:14,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:14,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 01:53:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705227781] [2024-11-06 01:53:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 01:53:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 01:53:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 01:53:14,341 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:14,392 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-11-06 01:53:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 01:53:14,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-11-06 01:53:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:14,393 INFO L225 Difference]: With dead ends: 78 [2024-11-06 01:53:14,393 INFO L226 Difference]: Without dead ends: 65 [2024-11-06 01:53:14,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 01:53:14,394 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:14,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 170 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-06 01:53:14,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2024-11-06 01:53:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2024-11-06 01:53:14,408 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 76 [2024-11-06 01:53:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:14,408 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2024-11-06 01:53:14,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-11-06 01:53:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-06 01:53:14,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:14,409 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:14,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 01:53:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:14,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:14,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1665566163, now seen corresponding path program 1 times [2024-11-06 01:53:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504186362] [2024-11-06 01:53:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:14,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:14,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:14,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:53:14,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-06 01:53:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:14,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:53:14,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 01:53:14,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 01:53:14,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:14,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504186362] [2024-11-06 01:53:14,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504186362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:14,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:14,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 01:53:14,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284829646] [2024-11-06 01:53:14,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:14,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 01:53:14,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:14,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 01:53:14,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-06 01:53:14,867 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:15,018 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2024-11-06 01:53:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 01:53:15,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-06 01:53:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:15,021 INFO L225 Difference]: With dead ends: 96 [2024-11-06 01:53:15,021 INFO L226 Difference]: Without dead ends: 83 [2024-11-06 01:53:15,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 01:53:15,022 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 38 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:15,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 278 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 01:53:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-06 01:53:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2024-11-06 01:53:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 66 states have internal predecessors, (71), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2024-11-06 01:53:15,037 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 79 [2024-11-06 01:53:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:15,038 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2024-11-06 01:53:15,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2024-11-06 01:53:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-06 01:53:15,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:15,039 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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-06 01:53:15,047 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-06 01:53:15,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:15,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:15,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1723356737, now seen corresponding path program 2 times [2024-11-06 01:53:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:15,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817272219] [2024-11-06 01:53:15,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:53:15,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:15,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:15,245 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-06 01:53:15,248 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-06 01:53:15,369 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 01:53:15,369 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:15,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 01:53:15,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 01:53:15,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 01:53:15,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:15,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817272219] [2024-11-06 01:53:15,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817272219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:15,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:15,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-06 01:53:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657337244] [2024-11-06 01:53:15,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:15,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 01:53:15,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:15,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 01:53:15,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-06 01:53:15,612 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:15,975 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2024-11-06 01:53:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 01:53:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 88 [2024-11-06 01:53:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:15,977 INFO L225 Difference]: With dead ends: 121 [2024-11-06 01:53:15,977 INFO L226 Difference]: Without dead ends: 101 [2024-11-06 01:53:15,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2024-11-06 01:53:15,978 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 89 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:15,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 404 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 01:53:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-06 01:53:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2024-11-06 01:53:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.072289156626506) internal successors, (89), 84 states have internal predecessors, (89), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-11-06 01:53:15,990 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 88 [2024-11-06 01:53:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:15,990 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-11-06 01:53:15,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-11-06 01:53:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-06 01:53:15,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:15,996 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:16,003 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 (9)] Ended with exit code 0 [2024-11-06 01:53:16,197 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-06 01:53:16,197 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:16,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1440686483, now seen corresponding path program 3 times [2024-11-06 01:53:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573637786] [2024-11-06 01:53:16,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 01:53:16,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:16,200 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-06 01:53:16,201 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-06 01:53:16,312 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 01:53:16,312 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:16,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 01:53:16,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-06 01:53:16,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-06 01:53:16,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:16,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573637786] [2024-11-06 01:53:16,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573637786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:16,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:16,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 01:53:16,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643747602] [2024-11-06 01:53:16,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:16,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 01:53:16,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:16,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 01:53:16,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 01:53:16,460 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:16,515 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2024-11-06 01:53:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 01:53:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 97 [2024-11-06 01:53:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:16,517 INFO L225 Difference]: With dead ends: 116 [2024-11-06 01:53:16,517 INFO L226 Difference]: Without dead ends: 109 [2024-11-06 01:53:16,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 01:53:16,518 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:16,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-06 01:53:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-06 01:53:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 98 states have internal predecessors, (104), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2024-11-06 01:53:16,527 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 97 [2024-11-06 01:53:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2024-11-06 01:53:16,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2024-11-06 01:53:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-06 01:53:16,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:16,529 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:16,536 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-06 01:53:16,733 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-06 01:53:16,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2046948329, now seen corresponding path program 4 times [2024-11-06 01:53:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:16,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727146707] [2024-11-06 01:53:16,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 01:53:16,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:16,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:16,738 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-06 01:53:16,739 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-06 01:53:16,871 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 01:53:16,871 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:16,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-06 01:53:16,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 117 proven. 223 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 01:53:17,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 136 proven. 204 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 01:53:17,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727146707] [2024-11-06 01:53:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727146707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:17,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:17,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2024-11-06 01:53:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899628222] [2024-11-06 01:53:17,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:17,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-06 01:53:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-06 01:53:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-11-06 01:53:17,787 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:19,605 INFO L93 Difference]: Finished difference Result 228 states and 267 transitions. [2024-11-06 01:53:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-06 01:53:19,606 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 130 [2024-11-06 01:53:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:19,611 INFO L225 Difference]: With dead ends: 228 [2024-11-06 01:53:19,611 INFO L226 Difference]: Without dead ends: 204 [2024-11-06 01:53:19,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=386, Invalid=2064, Unknown=0, NotChecked=0, Total=2450 [2024-11-06 01:53:19,613 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 88 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:19,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1117 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 01:53:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-06 01:53:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2024-11-06 01:53:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 180 states have (on average 1.1166666666666667) internal successors, (201), 181 states have internal predecessors, (201), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 218 transitions. [2024-11-06 01:53:19,632 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 218 transitions. Word has length 130 [2024-11-06 01:53:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:19,632 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 218 transitions. [2024-11-06 01:53:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2024-11-06 01:53:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-06 01:53:19,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:19,634 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:19,640 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-06 01:53:19,838 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-06 01:53:19,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 725368747, now seen corresponding path program 5 times [2024-11-06 01:53:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184132787] [2024-11-06 01:53:19,840 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-06 01:53:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:19,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:19,841 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-06 01:53:19,842 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-06 01:53:19,965 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2024-11-06 01:53:19,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:19,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 01:53:19,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 250 proven. 78 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-06 01:53:20,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 254 proven. 74 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-06 01:53:20,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:20,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184132787] [2024-11-06 01:53:20,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184132787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:20,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:20,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-06 01:53:20,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333089913] [2024-11-06 01:53:20,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:20,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-06 01:53:20,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-06 01:53:20,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2024-11-06 01:53:20,893 INFO L87 Difference]: Start difference. First operand 192 states and 218 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:21,998 INFO L93 Difference]: Finished difference Result 304 states and 351 transitions. [2024-11-06 01:53:21,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-06 01:53:21,998 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 133 [2024-11-06 01:53:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:22,000 INFO L225 Difference]: With dead ends: 304 [2024-11-06 01:53:22,000 INFO L226 Difference]: Without dead ends: 241 [2024-11-06 01:53:22,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=519, Invalid=1833, Unknown=0, NotChecked=0, Total=2352 [2024-11-06 01:53:22,002 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:22,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 788 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 01:53:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-06 01:53:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 228. [2024-11-06 01:53:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 216 states have (on average 1.0833333333333333) internal successors, (234), 217 states have internal predecessors, (234), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 251 transitions. [2024-11-06 01:53:22,020 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 251 transitions. Word has length 133 [2024-11-06 01:53:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:22,020 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 251 transitions. [2024-11-06 01:53:22,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 251 transitions. [2024-11-06 01:53:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-06 01:53:22,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:22,022 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:22,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-06 01:53:22,226 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-06 01:53:22,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:22,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash 773779819, now seen corresponding path program 6 times [2024-11-06 01:53:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:22,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663269761] [2024-11-06 01:53:22,228 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-06 01:53:22,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:22,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:22,229 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-06 01:53:22,230 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-06 01:53:22,524 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2024-11-06 01:53:22,524 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:22,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 01:53:22,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:22,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 01:53:22,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 01:53:22,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-11-06 01:53:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-11-06 01:53:22,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:23,078 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-06 01:53:23,079 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 19 treesize of output 11 [2024-11-06 01:53:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 202 proven. 12 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-11-06 01:53:23,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:23,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663269761] [2024-11-06 01:53:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663269761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:23,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:23,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-06 01:53:23,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505642427] [2024-11-06 01:53:23,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:23,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-06 01:53:23,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:23,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-06 01:53:23,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-06 01:53:23,304 INFO L87 Difference]: Start difference. First operand 228 states and 251 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:23,801 INFO L93 Difference]: Finished difference Result 328 states and 364 transitions. [2024-11-06 01:53:23,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 01:53:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 151 [2024-11-06 01:53:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:23,803 INFO L225 Difference]: With dead ends: 328 [2024-11-06 01:53:23,803 INFO L226 Difference]: Without dead ends: 241 [2024-11-06 01:53:23,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2024-11-06 01:53:23,804 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:23,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 470 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 01:53:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-06 01:53:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 163. [2024-11-06 01:53:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.0662251655629138) internal successors, (161), 152 states have internal predecessors, (161), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2024-11-06 01:53:23,816 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 151 [2024-11-06 01:53:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:23,816 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2024-11-06 01:53:23,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2024-11-06 01:53:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-06 01:53:23,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:23,818 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:23,824 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-06 01:53:24,018 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-06 01:53:24,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:24,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash 340995961, now seen corresponding path program 7 times [2024-11-06 01:53:24,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:24,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320395639] [2024-11-06 01:53:24,020 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-06 01:53:24,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:24,023 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-06 01:53:24,026 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-06 01:53:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:24,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 01:53:24,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 281 proven. 576 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-06 01:53:24,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 281 proven. 576 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-06 01:53:24,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:24,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320395639] [2024-11-06 01:53:24,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320395639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:24,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:24,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-06 01:53:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989619328] [2024-11-06 01:53:24,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:24,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-06 01:53:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-06 01:53:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-06 01:53:24,647 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:25,187 INFO L93 Difference]: Finished difference Result 406 states and 438 transitions. [2024-11-06 01:53:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-06 01:53:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 168 [2024-11-06 01:53:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:25,189 INFO L225 Difference]: With dead ends: 406 [2024-11-06 01:53:25,190 INFO L226 Difference]: Without dead ends: 306 [2024-11-06 01:53:25,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2024-11-06 01:53:25,191 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 67 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:25,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 759 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 01:53:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-06 01:53:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 220. [2024-11-06 01:53:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 1.0576923076923077) internal successors, (220), 209 states have internal predecessors, (220), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 237 transitions. [2024-11-06 01:53:25,217 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 237 transitions. Word has length 168 [2024-11-06 01:53:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:25,218 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 237 transitions. [2024-11-06 01:53:25,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 237 transitions. [2024-11-06 01:53:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-06 01:53:25,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:25,220 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:25,229 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-06 01:53:25,423 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-06 01:53:25,424 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:25,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1898993733, now seen corresponding path program 8 times [2024-11-06 01:53:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:25,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530185902] [2024-11-06 01:53:25,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:53:25,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:25,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:25,426 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-06 01:53:25,427 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-06 01:53:25,650 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 01:53:25,651 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:25,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 01:53:25,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 132 proven. 802 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-06 01:53:25,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 132 proven. 802 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-06 01:53:26,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:26,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530185902] [2024-11-06 01:53:26,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530185902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:26,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-06 01:53:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989329471] [2024-11-06 01:53:26,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:26,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-06 01:53:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:26,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-06 01:53:26,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-06 01:53:26,026 INFO L87 Difference]: Start difference. First operand 220 states and 237 transitions. Second operand has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:26,462 INFO L93 Difference]: Finished difference Result 481 states and 518 transitions. [2024-11-06 01:53:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-06 01:53:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 171 [2024-11-06 01:53:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:26,465 INFO L225 Difference]: With dead ends: 481 [2024-11-06 01:53:26,465 INFO L226 Difference]: Without dead ends: 381 [2024-11-06 01:53:26,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2024-11-06 01:53:26,466 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 61 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:26,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 715 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 01:53:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-06 01:53:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 226. [2024-11-06 01:53:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 214 states have (on average 1.0654205607476634) internal successors, (228), 215 states have internal predecessors, (228), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-06 01:53:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 245 transitions. [2024-11-06 01:53:26,506 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 245 transitions. Word has length 171 [2024-11-06 01:53:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:26,506 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 245 transitions. [2024-11-06 01:53:26,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 01:53:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 245 transitions. [2024-11-06 01:53:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-06 01:53:26,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:26,507 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:26,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-06 01:53:26,708 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-06 01:53:26,708 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:26,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 773529361, now seen corresponding path program 9 times [2024-11-06 01:53:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:26,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579360596] [2024-11-06 01:53:26,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 01:53:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:53:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:26,712 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-06 01:53:26,714 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-06 01:53:27,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2024-11-06 01:53:27,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 01:53:27,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 01:53:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 01:53:28,182 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 01:53:28,182 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 01:53:28,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 01:53:28,199 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-06 01:53:28,388 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-06 01:53:28,391 INFO L407 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:28,465 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 01:53:28,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 01:53:28 BoogieIcfgContainer [2024-11-06 01:53:28,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 01:53:28,470 INFO L158 Benchmark]: Toolchain (without parser) took 17837.11ms. Allocated memory was 185.6MB in the beginning and 351.3MB in the end (delta: 165.7MB). Free memory was 146.2MB in the beginning and 272.5MB in the end (delta: -126.3MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2024-11-06 01:53:28,471 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 185.6MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 01:53:28,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.81ms. Allocated memory is still 185.6MB. Free memory was 145.9MB in the beginning and 132.2MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-06 01:53:28,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 185.6MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 01:53:28,471 INFO L158 Benchmark]: Boogie Preprocessor took 46.90ms. Allocated memory is still 185.6MB. Free memory was 130.1MB in the beginning and 127.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 01:53:28,471 INFO L158 Benchmark]: RCFGBuilder took 484.80ms. Allocated memory is still 185.6MB. Free memory was 127.4MB in the beginning and 106.8MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-11-06 01:53:28,472 INFO L158 Benchmark]: TraceAbstraction took 16987.15ms. Allocated memory was 185.6MB in the beginning and 351.3MB in the end (delta: 165.7MB). Free memory was 106.0MB in the beginning and 272.5MB in the end (delta: -166.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-06 01:53:28,473 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.15ms. Allocated memory is still 185.6MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.81ms. Allocated memory is still 185.6MB. Free memory was 145.9MB in the beginning and 132.2MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 185.6MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.90ms. Allocated memory is still 185.6MB. Free memory was 130.1MB in the beginning and 127.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 484.80ms. Allocated memory is still 185.6MB. Free memory was 127.4MB in the beginning and 106.8MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 16987.15ms. Allocated memory was 185.6MB in the beginning and 351.3MB in the end (delta: 165.7MB). Free memory was 106.0MB in the beginning and 272.5MB in the end (delta: -166.5MB). Peak memory consumption was 1.0MB. 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: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=9, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=5, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=6, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=7, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=1, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=0, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=8, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=2, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={5:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=0] [L38] i++ VAL [d={5:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=1] [L38] i++ VAL [d={5:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=2] [L38] i++ VAL [d={5:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=3] [L38] i++ VAL [d={5:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=4] [L38] i++ VAL [d={5:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=5] [L38] i++ VAL [d={5:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=6] [L38] i++ VAL [d={5:0}, i=7] [L38] COND FALSE !(i < 7) VAL [d={5:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 15, TraceHistogramMax: 28, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 6342 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5421 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2244 IncrementalHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 921 mSDtfsCounter, 2244 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2431 GetRequests, 2177 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=11, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 369 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1503 NumberOfCodeBlocks, 1353 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 2314 ConstructedInterpolants, 0 QuantifiedInterpolants, 4969 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2406 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 5190/8721 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-06 01:53:28,499 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...