/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/float-benchs/inv_Newton.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 00:22:08,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 00:22:08,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 00:22:08,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 00:22:08,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 00:22:08,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 00:22:08,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 00:22:08,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 00:22:08,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 00:22:08,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 00:22:08,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 00:22:08,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 00:22:08,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 00:22:08,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 00:22:08,159 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 00:22:08,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 00:22:08,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 00:22:08,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 00:22:08,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 00:22:08,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 00:22:08,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 00:22:08,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 00:22:08,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 00:22:08,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 00:22:08,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 00:22:08,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 00:22:08,168 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 00:22:08,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 00:22:08,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 00:22:08,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 00:22:08,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 00:22:08,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 00:22:08,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 00:22:08,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 00:22:08,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 00:22:08,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 00:22:08,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 00:22:08,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 00:22:08,172 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 00:22:08,173 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 00:22:08,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 00:22:08,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 00:22:08,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 00:22:08,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 00:22:08,176 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 00:22:08,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 00:22:08,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 00:22:08,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 00:22:08,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 00:22:08,446 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 00:22:08,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-06 00:22:09,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 00:22:10,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 00:22:10,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-06 00:22:10,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b304f59d6/7ef73d7b5cce49bab5690dd8e99c36f9/FLAG2853d47ba [2024-11-06 00:22:10,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b304f59d6/7ef73d7b5cce49bab5690dd8e99c36f9 [2024-11-06 00:22:10,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 00:22:10,530 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 00:22:10,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 00:22:10,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 00:22:10,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 00:22:10,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5207f608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10, skipping insertion in model container [2024-11-06 00:22:10,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 00:22:10,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-06 00:22:10,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 00:22:10,753 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 00:22:10,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-06 00:22:10,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 00:22:10,801 INFO L204 MainTranslator]: Completed translation [2024-11-06 00:22:10,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10 WrapperNode [2024-11-06 00:22:10,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 00:22:10,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 00:22:10,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 00:22:10,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 00:22:10,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,835 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 103 [2024-11-06 00:22:10,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 00:22:10,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 00:22:10,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 00:22:10,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 00:22:10,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,863 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-06 00:22:10,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 00:22:10,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 00:22:10,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 00:22:10,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 00:22:10,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (1/1) ... [2024-11-06 00:22:10,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 00:22:10,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 00:22:10,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 00:22:10,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 00:22:10,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 00:22:10,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-06 00:22:10,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-06 00:22:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-06 00:22:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-06 00:22:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-06 00:22:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 00:22:10,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 00:22:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 00:22:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-06 00:22:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-06 00:22:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-06 00:22:11,084 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 00:22:11,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 00:22:15,591 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-06 00:22:15,592 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 00:22:15,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 00:22:15,609 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-06 00:22:15,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:15 BoogieIcfgContainer [2024-11-06 00:22:15,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 00:22:15,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 00:22:15,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 00:22:15,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 00:22:15,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:22:10" (1/3) ... [2024-11-06 00:22:15,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1071e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:22:15, skipping insertion in model container [2024-11-06 00:22:15,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:10" (2/3) ... [2024-11-06 00:22:15,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1071e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:22:15, skipping insertion in model container [2024-11-06 00:22:15,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:15" (3/3) ... [2024-11-06 00:22:15,620 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2024-11-06 00:22:15,635 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 00:22:15,635 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 00:22:15,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 00:22:15,688 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;@3e1af8a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 00:22:15,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 00:22:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-06 00:22:15,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:15,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:15,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:15,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2024-11-06 00:22:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:15,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94612899] [2024-11-06 00:22:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:22:15,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:22:15,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:15,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 00:22:15,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 00:22:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:22:15,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 00:22:15,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:22:15,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:22:15,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:22:15,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94612899] [2024-11-06 00:22:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94612899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:22:15,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:22:15,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 00:22:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325833120] [2024-11-06 00:22:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:22:15,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 00:22:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:22:15,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 00:22:15,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 00:22:15,991 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:20,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 00:22:24,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 00:22:28,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 00:22:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:22:28,549 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-11-06 00:22:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 00:22:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-06 00:22:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:22:28,646 INFO L225 Difference]: With dead ends: 32 [2024-11-06 00:22:28,646 INFO L226 Difference]: Without dead ends: 19 [2024-11-06 00:22:28,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 00:22:28,653 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-06 00:22:28,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2024-11-06 00:22:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-06 00:22:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-06 00:22:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-06 00:22:28,699 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2024-11-06 00:22:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:22:28,699 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-06 00:22:28,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-06 00:22:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 00:22:28,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:28,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:28,709 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 00:22:28,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:22:28,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:28,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2024-11-06 00:22:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:28,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976289692] [2024-11-06 00:22:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:22:28,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:22:28,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:28,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 00:22:28,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 00:22:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:22:29,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 00:22:29,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:22:29,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:22:29,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:22:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976289692] [2024-11-06 00:22:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976289692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:22:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:22:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 00:22:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280750334] [2024-11-06 00:22:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:22:29,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 00:22:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:22:29,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 00:22:29,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 00:22:29,687 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:33,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 00:22:37,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 00:22:41,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 00:22:46,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 00:22:50,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 00:22:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:22:50,260 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-11-06 00:22:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 00:22:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-06 00:22:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:22:50,335 INFO L225 Difference]: With dead ends: 28 [2024-11-06 00:22:50,335 INFO L226 Difference]: Without dead ends: 21 [2024-11-06 00:22:50,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 00:22:50,337 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-11-06 00:22:50,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2024-11-06 00:22:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-06 00:22:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-06 00:22:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-06 00:22:50,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2024-11-06 00:22:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:22:50,341 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-06 00:22:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-11-06 00:22:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 00:22:50,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:50,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:50,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 00:22:50,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:22:50,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:50,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2024-11-06 00:22:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819986406] [2024-11-06 00:22:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:22:50,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:22:50,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:50,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 00:22:50,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 00:22:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:22:51,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 00:22:51,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 00:22:51,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:22:51,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:22:51,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819986406] [2024-11-06 00:22:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819986406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:22:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:22:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 00:22:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899270132] [2024-11-06 00:22:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:22:51,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 00:22:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:22:51,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 00:22:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 00:22:51,298 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:22:51,398 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-06 00:22:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 00:22:51,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-06 00:22:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:22:51,399 INFO L225 Difference]: With dead ends: 24 [2024-11-06 00:22:51,399 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 00:22:51,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 00:22:51,400 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 00:22:51,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 00:22:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 00:22:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-06 00:22:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-06 00:22:51,404 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-11-06 00:22:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:22:51,404 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-06 00:22:51,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:22:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-06 00:22:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 00:22:51,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:51,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:51,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 00:22:51,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:22:51,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:51,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2024-11-06 00:22:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:51,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847805324] [2024-11-06 00:22:51,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:22:51,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:22:51,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:51,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 00:22:51,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 00:22:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:22:52,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 00:22:52,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:53,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-06 00:22:53,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 00:22:53,494 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 56 treesize of output 20 [2024-11-06 00:23:02,084 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 00:23:10,377 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 00:23:18,687 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 00:23:26,998 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 00:23:35,289 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 00:23:39,379 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) v_arrayElimCell_1))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-06 00:23:47,646 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 00:23:55,935 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)