./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float18.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 18:25:35,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 18:25:35,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 18:25:35,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 18:25:35,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 18:25:35,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 18:25:35,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 18:25:35,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 18:25:35,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 18:25:35,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 18:25:35,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 18:25:35,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 18:25:35,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 18:25:35,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 18:25:35,862 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 18:25:35,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 18:25:35,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 18:25:35,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 18:25:35,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 18:25:35,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 18:25:35,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 18:25:35,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 18:25:35,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 18:25:35,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:25:35,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 18:25:35,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 18:25:35,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 18:25:35,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 18:25:35,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 18:25:35,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 18:25:35,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 18:25:35,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 18:25:35,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 18:25:35,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 18:25:35,868 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 [2025-02-07 18:25:36,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 18:25:36,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 18:25:36,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 18:25:36,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 18:25:36,066 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 18:25:36,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float18.i [2025-02-07 18:25:37,220 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d01893fd/1e7c96de50914090bf966b7ebef5186f/FLAGf19617a72 [2025-02-07 18:25:37,515 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 18:25:37,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i [2025-02-07 18:25:37,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d01893fd/1e7c96de50914090bf966b7ebef5186f/FLAGf19617a72 [2025-02-07 18:25:37,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d01893fd/1e7c96de50914090bf966b7ebef5186f [2025-02-07 18:25:37,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 18:25:37,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 18:25:37,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 18:25:37,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 18:25:37,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 18:25:37,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:25:37" (1/1) ... [2025-02-07 18:25:37,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5621c79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:37, skipping insertion in model container [2025-02-07 18:25:37,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:25:37" (1/1) ... [2025-02-07 18:25:37,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 18:25:38,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i[40835,40848] [2025-02-07 18:25:38,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:25:38,119 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 18:25:38,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i[40835,40848] [2025-02-07 18:25:38,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:25:38,201 INFO L204 MainTranslator]: Completed translation [2025-02-07 18:25:38,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38 WrapperNode [2025-02-07 18:25:38,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 18:25:38,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 18:25:38,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 18:25:38,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 18:25:38,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,224 INFO L138 Inliner]: procedures = 446, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-02-07 18:25:38,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 18:25:38,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 18:25:38,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 18:25:38,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 18:25:38,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 18:25:38,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 18:25:38,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 18:25:38,240 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 18:25:38,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 18:25:38,241 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (1/1) ... [2025-02-07 18:25:38,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:25:38,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:25:38,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 18:25:38,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 18:25:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 18:25:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 18:25:38,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 18:25:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 18:25:38,394 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 18:25:38,400 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 18:25:38,501 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-07 18:25:38,501 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 18:25:38,513 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 18:25:38,513 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 18:25:38,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:25:38 BoogieIcfgContainer [2025-02-07 18:25:38,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 18:25:38,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 18:25:38,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 18:25:38,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 18:25:38,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 06:25:37" (1/3) ... [2025-02-07 18:25:38,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4deee849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:25:38, skipping insertion in model container [2025-02-07 18:25:38,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:38" (2/3) ... [2025-02-07 18:25:38,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4deee849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:25:38, skipping insertion in model container [2025-02-07 18:25:38,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:25:38" (3/3) ... [2025-02-07 18:25:38,528 INFO L128 eAbstractionObserver]: Analyzing ICFG float18.i [2025-02-07 18:25:38,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 18:25:38,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float18.i that has 1 procedures, 9 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 18:25:38,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 18:25:38,643 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;@14cdcbb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 18:25:38,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 18:25:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2025-02-07 18:25:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 18:25:38,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:25:38,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 18:25:38,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:25:38,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:25:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1199423, now seen corresponding path program 1 times [2025-02-07 18:25:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:25:38,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256894172] [2025-02-07 18:25:38,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:25:38,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:25:38,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 18:25:38,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 18:25:38,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:25:38,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:25:38,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256894172] [2025-02-07 18:25:38,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256894172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:25:38,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:25:38,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 18:25:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526474150] [2025-02-07 18:25:38,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:25:38,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 18:25:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:25:38,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 18:25:38,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 18:25:38,806 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2025-02-07 18:25:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:25:38,812 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-02-07 18:25:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 18:25:38,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-07 18:25:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:25:38,817 INFO L225 Difference]: With dead ends: 15 [2025-02-07 18:25:38,817 INFO L226 Difference]: Without dead ends: 6 [2025-02-07 18:25:38,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 18:25:38,823 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:25:38,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:25:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2025-02-07 18:25:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-02-07 18:25:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) [2025-02-07 18:25:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2025-02-07 18:25:38,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2025-02-07 18:25:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:25:38,845 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-02-07 18:25:38,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2025-02-07 18:25:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2025-02-07 18:25:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 18:25:38,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:25:38,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 18:25:38,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 18:25:38,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:25:38,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:25:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash 37155238, now seen corresponding path program 1 times [2025-02-07 18:25:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:25:38,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158799818] [2025-02-07 18:25:38,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:25:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:25:38,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 18:25:38,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 18:25:38,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:25:38,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:25:38,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158799818] [2025-02-07 18:25:38,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158799818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:25:38,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:25:38,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 18:25:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404932892] [2025-02-07 18:25:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:25:38,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 18:25:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:25:38,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 18:25:38,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 18:25:38,945 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-02-07 18:25:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:25:38,956 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-02-07 18:25:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 18:25:38,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-07 18:25:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:25:38,957 INFO L225 Difference]: With dead ends: 12 [2025-02-07 18:25:38,957 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 18:25:38,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 18:25:38,958 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:25:38,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:25:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 18:25:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 18:25:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2025-02-07 18:25:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 18:25:38,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2025-02-07 18:25:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:25:38,962 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 18:25:38,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-02-07 18:25:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 18:25:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 18:25:38,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:25:38,962 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 18:25:38,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 18:25:38,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:25:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:25:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1345644932, now seen corresponding path program 1 times [2025-02-07 18:25:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:25:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133237808] [2025-02-07 18:25:38,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:25:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:25:38,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 18:25:38,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 18:25:38,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:25:38,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:25:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133237808] [2025-02-07 18:25:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133237808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 18:25:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677107853] [2025-02-07 18:25:39,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:25:39,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:25:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:25:39,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 18:25:39,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 18:25:39,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 18:25:39,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 18:25:39,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:25:39,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:39,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 18:25:39,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:25:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:39,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:25:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677107853] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:25:39,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 18:25:39,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 18:25:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450756436] [2025-02-07 18:25:39,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 18:25:39,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 18:25:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:25:39,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 18:25:39,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-07 18:25:39,142 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:25:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:25:39,158 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-02-07 18:25:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 18:25:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 18:25:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:25:39,158 INFO L225 Difference]: With dead ends: 23 [2025-02-07 18:25:39,158 INFO L226 Difference]: Without dead ends: 17 [2025-02-07 18:25:39,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-07 18:25:39,159 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:25:39,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:25:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-07 18:25:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-02-07 18:25:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:25:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-02-07 18:25:39,161 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 7 [2025-02-07 18:25:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:25:39,161 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-02-07 18:25:39,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:25:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-02-07 18:25:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 18:25:39,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:25:39,161 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2025-02-07 18:25:39,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 18:25:39,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:25:39,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:25:39,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:25:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2104921596, now seen corresponding path program 2 times [2025-02-07 18:25:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:25:39,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984215669] [2025-02-07 18:25:39,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 18:25:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:25:39,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-07 18:25:39,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 18:25:39,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 18:25:39,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:25:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984215669] [2025-02-07 18:25:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984215669] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 18:25:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571206813] [2025-02-07 18:25:39,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 18:25:39,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:25:39,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:25:39,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 18:25:39,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 18:25:39,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-07 18:25:39,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 18:25:39,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 18:25:39,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:39,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 18:25:39,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:25:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:39,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:25:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:39,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571206813] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:25:39,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 18:25:39,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-02-07 18:25:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870073000] [2025-02-07 18:25:39,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 18:25:39,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 18:25:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:25:39,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 18:25:39,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-07 18:25:39,711 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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) [2025-02-07 18:25:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:25:39,727 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-02-07 18:25:39,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 18:25:39,727 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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) Word has length 15 [2025-02-07 18:25:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:25:39,728 INFO L225 Difference]: With dead ends: 34 [2025-02-07 18:25:39,728 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 18:25:39,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-07 18:25:39,729 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:25:39,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 25 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:25:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 18:25:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-07 18:25:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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) [2025-02-07 18:25:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-02-07 18:25:39,732 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 15 [2025-02-07 18:25:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:25:39,732 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-02-07 18:25:39,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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) [2025-02-07 18:25:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-02-07 18:25:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 18:25:39,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:25:39,733 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2025-02-07 18:25:39,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 18:25:39,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:25:39,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:25:39,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:25:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1749600558, now seen corresponding path program 3 times [2025-02-07 18:25:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:25:39,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811158046] [2025-02-07 18:25:39,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 18:25:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:25:39,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-02-07 18:25:39,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 18:25:39,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 18:25:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 18:25:39,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 18:25:39,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 18:25:39,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 18:25:39,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:25:39,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 18:25:39,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 18:25:39,966 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 18:25:39,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 18:25:39,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 18:25:39,972 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-07 18:25:39,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 18:25:39,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 06:25:39 BoogieIcfgContainer [2025-02-07 18:25:39,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 18:25:39,993 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 18:25:39,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 18:25:39,993 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 18:25:39,995 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:25:38" (3/4) ... [2025-02-07 18:25:39,996 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 18:25:39,996 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 18:25:39,997 INFO L158 Benchmark]: Toolchain (without parser) took 2202.92ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 70.3MB in the end (delta: 43.1MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2025-02-07 18:25:39,997 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:25:39,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.77ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 70.5MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 18:25:39,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.43ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 68.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:25:39,999 INFO L158 Benchmark]: Boogie Preprocessor took 14.68ms. Allocated memory is still 142.6MB. Free memory was 68.7MB in the beginning and 67.8MB in the end (delta: 937.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:25:39,999 INFO L158 Benchmark]: IcfgBuilder took 273.19ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 57.4MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 18:25:39,999 INFO L158 Benchmark]: TraceAbstraction took 1472.36ms. Allocated memory is still 142.6MB. Free memory was 56.9MB in the beginning and 70.3MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:25:39,999 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 70.3MB in the end (delta: 27.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 18:25:40,001 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.23ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.77ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 70.5MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.43ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 68.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.68ms. Allocated memory is still 142.6MB. Free memory was 68.7MB in the beginning and 67.8MB in the end (delta: 937.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 273.19ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 57.4MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1472.36ms. Allocated memory is still 142.6MB. Free memory was 56.9MB in the beginning and 70.3MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 70.3MB in the end (delta: 27.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 979]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 968, overapproximation of someBinaryArithmeticDOUBLEoperation at line 974, overapproximation of someBinaryDOUBLEComparisonOperation at line 977. Possible FailurePath: [L968] double s, f=0.0, fStep=0.1*3.14159265358979323846; [L969] int n=0; VAL [n=0] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=1] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=1] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=2] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=2] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=3] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=3] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=4] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=4] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=5] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=5] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=6] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=6] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=7] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=7] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=8] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=8] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=9] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=9] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=10] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=10] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=11] [L977] COND FALSE !(f < 3.14159265358979323846) VAL [n=11] [L979] COND TRUE !( n < 11 ) [L979] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 24 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/96 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 18:25:40,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float18.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 18:25:41,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 18:25:42,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 18:25:42,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 18:25:42,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 18:25:42,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 18:25:42,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 18:25:42,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 18:25:42,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 18:25:42,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 18:25:42,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 18:25:42,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 18:25:42,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 18:25:42,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 18:25:42,068 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 18:25:42,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 18:25:42,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 18:25:42,069 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 18:25:42,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 18:25:42,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 18:25:42,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 18:25:42,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 18:25:42,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 18:25:42,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 18:25:42,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:25:42,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 18:25:42,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 18:25:42,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 18:25:42,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 18:25:42,071 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 18:25:42,072 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 18:25:42,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 18:25:42,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 18:25:42,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 18:25:42,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 18:25:42,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 [2025-02-07 18:25:42,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 18:25:42,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 18:25:42,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 18:25:42,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 18:25:42,333 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 18:25:42,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float18.i [2025-02-07 18:25:43,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b70dfbb8/490edbf3491341cd9a37b1d38ecd4b86/FLAGe9f054db8 [2025-02-07 18:25:43,883 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 18:25:43,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i [2025-02-07 18:25:43,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b70dfbb8/490edbf3491341cd9a37b1d38ecd4b86/FLAGe9f054db8 [2025-02-07 18:25:44,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b70dfbb8/490edbf3491341cd9a37b1d38ecd4b86 [2025-02-07 18:25:44,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 18:25:44,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 18:25:44,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 18:25:44,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 18:25:44,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 18:25:44,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c4b0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44, skipping insertion in model container [2025-02-07 18:25:44,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 18:25:44,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i[40835,40848] [2025-02-07 18:25:44,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:25:44,505 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 18:25:44,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i[40835,40848] [2025-02-07 18:25:44,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:25:44,608 INFO L204 MainTranslator]: Completed translation [2025-02-07 18:25:44,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44 WrapperNode [2025-02-07 18:25:44,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 18:25:44,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 18:25:44,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 18:25:44,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 18:25:44,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,648 INFO L138 Inliner]: procedures = 447, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2025-02-07 18:25:44,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 18:25:44,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 18:25:44,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 18:25:44,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 18:25:44,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,662 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 18:25:44,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 18:25:44,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 18:25:44,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 18:25:44,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 18:25:44,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (1/1) ... [2025-02-07 18:25:44,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:25:44,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:25:44,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 18:25:44,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 18:25:44,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 18:25:44,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 18:25:44,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 18:25:44,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 18:25:44,761 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 18:25:44,762 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 18:25:44,954 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-07 18:25:44,954 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 18:25:44,968 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 18:25:44,968 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 18:25:44,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:25:44 BoogieIcfgContainer [2025-02-07 18:25:44,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 18:25:44,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 18:25:44,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 18:25:44,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 18:25:44,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 06:25:44" (1/3) ... [2025-02-07 18:25:44,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5631db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:25:44, skipping insertion in model container [2025-02-07 18:25:44,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:25:44" (2/3) ... [2025-02-07 18:25:44,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5631db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:25:44, skipping insertion in model container [2025-02-07 18:25:44,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:25:44" (3/3) ... [2025-02-07 18:25:44,976 INFO L128 eAbstractionObserver]: Analyzing ICFG float18.i [2025-02-07 18:25:44,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 18:25:44,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float18.i that has 1 procedures, 9 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 18:25:45,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 18:25:45,030 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;@6054e0be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 18:25:45,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 18:25:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2025-02-07 18:25:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 18:25:45,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:25:45,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 18:25:45,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:25:45,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:25:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1199423, now seen corresponding path program 1 times [2025-02-07 18:25:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:25:45,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435693594] [2025-02-07 18:25:45,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:25:45,048 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 [2025-02-07 18:25:45,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:25:45,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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) [2025-02-07 18:25:45,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:25:45,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 18:25:45,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 18:25:45,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:25:45,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:45,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 18:25:45,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:25:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:45,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:25:45,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:25:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435693594] [2025-02-07 18:25:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435693594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:25:45,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:25:45,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 18:25:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339064457] [2025-02-07 18:25:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:25:45,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 18:25:45,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:25:45,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 18:25:45,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 18:25:45,282 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2025-02-07 18:25:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:25:45,288 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-02-07 18:25:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 18:25:45,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-07 18:25:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:25:45,292 INFO L225 Difference]: With dead ends: 15 [2025-02-07 18:25:45,292 INFO L226 Difference]: Without dead ends: 6 [2025-02-07 18:25:45,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 18:25:45,295 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:25:45,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:25:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2025-02-07 18:25:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-02-07 18:25:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) [2025-02-07 18:25:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2025-02-07 18:25:45,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2025-02-07 18:25:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:25:45,310 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-02-07 18:25:45,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2025-02-07 18:25:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2025-02-07 18:25:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 18:25:45,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:25:45,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 18:25:45,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:25:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:25:45,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:25:45,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:25:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash 37155238, now seen corresponding path program 1 times [2025-02-07 18:25:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:25:45,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655207573] [2025-02-07 18:25:45,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:25:45,516 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 [2025-02-07 18:25:45,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:25:45,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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) [2025-02-07 18:25:45,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:25:45,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 18:25:45,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 18:25:45,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:25:45,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:45,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 18:25:45,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:25:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:46,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:25:46,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:25:46,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655207573] [2025-02-07 18:25:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655207573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:25:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:25:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 18:25:46,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153445481] [2025-02-07 18:25:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:25:46,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 18:25:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:25:46,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 18:25:46,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 18:25:46,518 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-02-07 18:25:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:25:47,116 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-02-07 18:25:47,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 18:25:47,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-07 18:25:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:25:47,120 INFO L225 Difference]: With dead ends: 12 [2025-02-07 18:25:47,120 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 18:25:47,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 18:25:47,122 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 18:25:47,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 18:25:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 18:25:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 18:25:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2025-02-07 18:25:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 18:25:47,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2025-02-07 18:25:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:25:47,124 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 18:25:47,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-02-07 18:25:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 18:25:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 18:25:47,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:25:47,124 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 18:25:47,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:25:47,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:25:47,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:25:47,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:25:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1345644932, now seen corresponding path program 1 times [2025-02-07 18:25:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:25:47,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608491362] [2025-02-07 18:25:47,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:25:47,328 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 [2025-02-07 18:25:47,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:25:47,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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) [2025-02-07 18:25:47,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:25:47,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 18:25:47,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 18:25:47,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:25:47,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:25:47,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 18:25:47,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:25:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:25:50,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:26:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:14,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:26:14,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608491362] [2025-02-07 18:26:14,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608491362] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:26:14,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 18:26:14,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-07 18:26:14,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601088120] [2025-02-07 18:26:14,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 18:26:14,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 18:26:14,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:26:14,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 18:26:14,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 18:26:14,919 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) [2025-02-07 18:26:18,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:26:38,395 WARN L286 SmtUtils]: Spent 11.12s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 18:26:42,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:26:55,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:26:57,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:00,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:02,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:03,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:27:03,977 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2025-02-07 18:27:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 18:27:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 7 [2025-02-07 18:27:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:27:03,979 INFO L225 Difference]: With dead ends: 17 [2025-02-07 18:27:03,979 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 18:27:03,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=32, Invalid=57, Unknown=1, NotChecked=0, Total=90 [2025-02-07 18:27:03,982 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2025-02-07 18:27:03,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 19.8s Time] [2025-02-07 18:27:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 18:27:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-07 18:27:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:27:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 18:27:03,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-02-07 18:27:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:27:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 18:27:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) [2025-02-07 18:27:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 18:27:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 18:27:03,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:27:03,987 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2025-02-07 18:27:03,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:27:04,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:27:04,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:27:04,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:27:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash -502836194, now seen corresponding path program 2 times [2025-02-07 18:27:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:27:04,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328215101] [2025-02-07 18:27:04,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 18:27:04,189 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 [2025-02-07 18:27:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:27:04,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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) [2025-02-07 18:27:04,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:27:04,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-07 18:27:04,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 18:27:04,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 18:27:04,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:27:04,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 18:27:04,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:27:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:27:05,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:27:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:27:05,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:27:05,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328215101] [2025-02-07 18:27:05,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328215101] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:27:05,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 18:27:05,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-02-07 18:27:05,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242522695] [2025-02-07 18:27:05,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 18:27:05,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 18:27:05,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:27:05,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 18:27:05,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-07 18:27:05,679 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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) [2025-02-07 18:27:09,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:27:09,702 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-02-07 18:27:09,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 18:27:09,703 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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) Word has length 13 [2025-02-07 18:27:09,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:27:09,704 INFO L225 Difference]: With dead ends: 35 [2025-02-07 18:27:09,704 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 18:27:09,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2025-02-07 18:27:09,705 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-07 18:27:09,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 61 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-07 18:27:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 18:27:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-07 18:27:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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) [2025-02-07 18:27:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-02-07 18:27:09,710 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2025-02-07 18:27:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:27:09,710 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-02-07 18:27:09,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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) [2025-02-07 18:27:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-02-07 18:27:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 18:27:09,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:27:09,710 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2025-02-07 18:27:09,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:27:09,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:27:09,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:27:09,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:27:09,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1749600558, now seen corresponding path program 3 times [2025-02-07 18:27:09,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:27:09,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009899311] [2025-02-07 18:27:09,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 18:27:09,917 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 [2025-02-07 18:27:09,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:27:09,919 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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) [2025-02-07 18:27:09,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 [2025-02-07 18:27:09,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-02-07 18:27:11,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 18:27:11,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 18:27:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:27:11,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 18:27:11,090 INFO L279 TraceCheckSpWp]: Computing forward predicates...