./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 83a0614c205e8509abb6374f77d17b7065a071e3abf638495a02812bdb5a5d68 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:30:46,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:30:46,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:30:46,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:30:46,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:30:46,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:30:46,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:30:46,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:30:46,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:30:46,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:30:46,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:30:46,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:30:46,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:30:46,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:30:46,642 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:30:46,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:30:46,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:30:46,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:30:46,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:30:46,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:30:46,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:30:46,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:30:46,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:30:46,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:30:46,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:30:46,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:30:46,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:30:46,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:30:46,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:30:46,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:30:46,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:30:46,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:30:46,645 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/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 -> 83a0614c205e8509abb6374f77d17b7065a071e3abf638495a02812bdb5a5d68 [2025-03-17 02:30:46,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:30:46,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:30:46,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:30:46,876 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:30:46,876 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:30:46,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i [2025-03-17 02:30:48,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdedafbad/5a3b8c47fb9f4d33a1f6c475e5f433fe/FLAGd0b47c231 [2025-03-17 02:30:48,247 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:30:48,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i [2025-03-17 02:30:48,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdedafbad/5a3b8c47fb9f4d33a1f6c475e5f433fe/FLAGd0b47c231 [2025-03-17 02:30:48,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdedafbad/5a3b8c47fb9f4d33a1f6c475e5f433fe [2025-03-17 02:30:48,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:30:48,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:30:48,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:30:48,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:30:48,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:30:48,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e498088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48, skipping insertion in model container [2025-03-17 02:30:48,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:30:48,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i[913,926] [2025-03-17 02:30:48,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:30:48,760 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:30:48,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i[913,926] [2025-03-17 02:30:48,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:30:48,800 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:30:48,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48 WrapperNode [2025-03-17 02:30:48,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:30:48,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:30:48,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:30:48,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:30:48,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,830 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-17 02:30:48,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:30:48,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:30:48,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:30:48,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:30:48,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,848 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-03-17 02:30:48,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:30:48,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:30:48,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:30:48,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:30:48,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (1/1) ... [2025-03-17 02:30:48,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:30:48,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:48,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:30:48,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:30:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:30:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:30:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:30:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:30:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:30:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:30:48,967 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:30:48,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:30:49,137 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~bitwise12#1;havoc property_#t~short13#1; [2025-03-17 02:30:49,162 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 02:30:49,163 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:30:49,182 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:30:49,184 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:30:49,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:49 BoogieIcfgContainer [2025-03-17 02:30:49,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:30:49,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:30:49,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:30:49,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:30:49,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:30:48" (1/3) ... [2025-03-17 02:30:49,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606a5595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:49, skipping insertion in model container [2025-03-17 02:30:49,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:48" (2/3) ... [2025-03-17 02:30:49,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606a5595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:49, skipping insertion in model container [2025-03-17 02:30:49,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:49" (3/3) ... [2025-03-17 02:30:49,190 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-30.i [2025-03-17 02:30:49,202 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:30:49,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-30.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:30:49,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:30:49,264 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;@4c6078c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:30:49,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:30:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:30:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:30:49,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:49,278 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:30:49,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:49,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -109529595, now seen corresponding path program 1 times [2025-03-17 02:30:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566095396] [2025-03-17 02:30:49,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:49,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:30:49,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:30:49,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:49,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 02:30:49,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566095396] [2025-03-17 02:30:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566095396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:30:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980580579] [2025-03-17 02:30:49,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:49,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:30:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:49,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:30:49,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:30:49,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:30:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:30:49,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:49,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:30:49,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:30:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 02:30:49,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:30:49,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980580579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:49,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:30:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:30:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062530324] [2025-03-17 02:30:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:49,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:30:49,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:49,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:30:49,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:30:49,625 INFO L87 Difference]: Start difference. First operand has 55 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 02:30:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:49,644 INFO L93 Difference]: Finished difference Result 107 states and 176 transitions. [2025-03-17 02:30:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:30:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2025-03-17 02:30:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:49,651 INFO L225 Difference]: With dead ends: 107 [2025-03-17 02:30:49,651 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 02:30:49,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:30:49,654 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:49,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:30:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 02:30:49,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-17 02:30:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 41 states have internal predecessors, (60), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:30:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions. [2025-03-17 02:30:49,687 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 75 [2025-03-17 02:30:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:49,688 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 80 transitions. [2025-03-17 02:30:49,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 02:30:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2025-03-17 02:30:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:30:49,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:49,690 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:30:49,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:30:49,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:30:49,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:49,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 189958369, now seen corresponding path program 1 times [2025-03-17 02:30:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:49,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391436170] [2025-03-17 02:30:49,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:49,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:30:49,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:30:49,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:49,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:30:50,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:50,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391436170] [2025-03-17 02:30:50,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391436170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:50,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:50,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:30:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763553700] [2025-03-17 02:30:50,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:50,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:30:50,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:50,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:30:50,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:30:50,175 INFO L87 Difference]: Start difference. First operand 53 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:30:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:50,393 INFO L93 Difference]: Finished difference Result 186 states and 283 transitions. [2025-03-17 02:30:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:30:50,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2025-03-17 02:30:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:50,395 INFO L225 Difference]: With dead ends: 186 [2025-03-17 02:30:50,395 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 02:30:50,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:30:50,396 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 104 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:50,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 296 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:30:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 02:30:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2025-03-17 02:30:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:30:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2025-03-17 02:30:50,419 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 75 [2025-03-17 02:30:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:50,419 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2025-03-17 02:30:50,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:30:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2025-03-17 02:30:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:30:50,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:50,423 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:30:50,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:30:50,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash 695516994, now seen corresponding path program 1 times [2025-03-17 02:30:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:50,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016913023] [2025-03-17 02:30:50,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:50,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:30:50,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:30:50,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:50,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:30:50,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016913023] [2025-03-17 02:30:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016913023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:50,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:30:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378519436] [2025-03-17 02:30:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:50,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:30:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:50,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:30:50,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:30:50,555 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:30:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:50,630 INFO L93 Difference]: Finished difference Result 239 states and 360 transitions. [2025-03-17 02:30:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:30:50,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2025-03-17 02:30:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:50,633 INFO L225 Difference]: With dead ends: 239 [2025-03-17 02:30:50,634 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 02:30:50,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:30:50,634 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:50,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 217 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:30:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 02:30:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 128. [2025-03-17 02:30:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:30:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2025-03-17 02:30:50,655 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 75 [2025-03-17 02:30:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:50,655 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2025-03-17 02:30:50,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:30:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2025-03-17 02:30:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 02:30:50,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:50,657 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:30:50,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:30:50,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:50,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1378372823, now seen corresponding path program 1 times [2025-03-17 02:30:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879685009] [2025-03-17 02:30:50,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:50,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:50,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 02:30:50,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 02:30:50,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 02:30:50,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:50,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879685009] [2025-03-17 02:30:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879685009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:30:50,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426057312] [2025-03-17 02:30:50,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:50,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:30:50,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:50,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:30:50,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:30:50,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 02:30:51,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 02:30:51,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:51,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:51,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:30:51,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:30:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 02:30:51,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:30:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 02:30:51,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426057312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:30:51,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:30:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-03-17 02:30:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598940564] [2025-03-17 02:30:51,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:30:51,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 02:30:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:51,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 02:30:51,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:30:51,360 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 02:30:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:51,624 INFO L93 Difference]: Finished difference Result 283 states and 407 transitions. [2025-03-17 02:30:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:30:51,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 76 [2025-03-17 02:30:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:51,627 INFO L225 Difference]: With dead ends: 283 [2025-03-17 02:30:51,627 INFO L226 Difference]: Without dead ends: 179 [2025-03-17 02:30:51,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2025-03-17 02:30:51,628 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 473 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:51,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 262 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:30:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-17 02:30:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 152. [2025-03-17 02:30:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 112 states have internal predecessors, (144), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:30:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 204 transitions. [2025-03-17 02:30:51,651 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 204 transitions. Word has length 76 [2025-03-17 02:30:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:51,651 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 204 transitions. [2025-03-17 02:30:51,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 02:30:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 204 transitions. [2025-03-17 02:30:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 02:30:51,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:51,652 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:30:51,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:30:51,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 02:30:51,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:51,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2080695614, now seen corresponding path program 1 times [2025-03-17 02:30:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:51,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995206674] [2025-03-17 02:30:51,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:51,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:51,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 02:30:51,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 02:30:51,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:51,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:30:51,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:51,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995206674] [2025-03-17 02:30:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995206674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:51,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:51,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:30:51,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054329825] [2025-03-17 02:30:51,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:51,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:30:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:51,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:30:51,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:30:51,921 INFO L87 Difference]: Start difference. First operand 152 states and 204 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:30:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:51,951 INFO L93 Difference]: Finished difference Result 272 states and 369 transitions. [2025-03-17 02:30:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:30:51,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 77 [2025-03-17 02:30:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:51,952 INFO L225 Difference]: With dead ends: 272 [2025-03-17 02:30:51,953 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 02:30:51,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:30:51,954 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:51,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:30:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 02:30:51,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-17 02:30:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 112 states have internal predecessors, (142), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:30:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2025-03-17 02:30:51,966 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 77 [2025-03-17 02:30:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:51,967 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2025-03-17 02:30:51,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:30:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2025-03-17 02:30:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 02:30:51,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:51,970 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:30:51,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:30:51,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1512361083, now seen corresponding path program 1 times [2025-03-17 02:30:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987068423] [2025-03-17 02:30:51,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:51,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 02:30:52,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 02:30:52,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:52,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:30:52,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:30:52,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 02:30:52,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 02:30:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:30:52,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:30:52,084 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:30:52,085 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:30:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:30:52,088 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 02:30:52,135 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:30:52,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:30:52 BoogieIcfgContainer [2025-03-17 02:30:52,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:30:52,137 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:30:52,137 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:30:52,137 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:30:52,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:49" (3/4) ... [2025-03-17 02:30:52,139 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:30:52,140 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:30:52,140 INFO L158 Benchmark]: Toolchain (without parser) took 3526.44ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 66.6MB in the end (delta: 67.0MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2025-03-17 02:30:52,140 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:30:52,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.17ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 120.3MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:30:52,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.60ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 118.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:30:52,141 INFO L158 Benchmark]: Boogie Preprocessor took 28.57ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 116.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:30:52,141 INFO L158 Benchmark]: IcfgBuilder took 323.30ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 98.0MB in the end (delta: 18.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:30:52,141 INFO L158 Benchmark]: TraceAbstraction took 2951.03ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 66.6MB in the end (delta: 30.9MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2025-03-17 02:30:52,141 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 167.8MB. Free memory was 66.6MB in the beginning and 66.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:30:52,142 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.17ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 120.3MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.60ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 118.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.57ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 116.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.30ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 98.0MB in the end (delta: 18.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2951.03ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 66.6MB in the end (delta: 30.9MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 167.8MB. Free memory was 66.6MB in the beginning and 66.6MB in the end (delta: 50.8kB). There was no memory consumed. 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: 19]: 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 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] unsigned char last_1_var_1_1 = 1; [L36] signed long int last_1_var_1_11 = -2; [L37] signed long int last_1_var_1_15 = 1000; [L38] double last_1_var_1_16 = 0.2; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_1 = var_1_1 [L115] last_1_var_1_11 = var_1_11 [L116] last_1_var_1_15 = var_1_15 [L117] last_1_var_1_16 = var_1_16 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L96] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L97] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L97] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L98] var_1_7 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L99] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L100] var_1_10 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L101] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L102] var_1_13 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L103] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L104] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L104] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L105] var_1_14 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L106] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L107] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L107] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L108] var_1_17 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L109] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L110] var_1_18 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L111] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L43] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L44] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L49] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L50] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L51] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L53] signed long int stepLocal_2 = var_1_11; [L54] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L55] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L56] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L57] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L58] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L64] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L64] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L75] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L77] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L78] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L82] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L83] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L84] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L120-L121] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 94 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 642 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 980 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 594 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 386 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 113 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 607 NumberOfCodeBlocks, 607 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 597 ConstructedInterpolants, 0 QuantifiedInterpolants, 1325 SizeOfPredicates, 1 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 1320/1440 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-03-17 02:30:52,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 83a0614c205e8509abb6374f77d17b7065a071e3abf638495a02812bdb5a5d68 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:30:54,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:30:54,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:30:54,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:30:54,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:30:54,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:30:54,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:30:54,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:30:54,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:30:54,220 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:30:54,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:30:54,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:30:54,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:30:54,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:30:54,221 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:30:54,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:30:54,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:30:54,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:30:54,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:30:54,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:30:54,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:30:54,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:30:54,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:30:54,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:30:54,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:30:54,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:30:54,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:30:54,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:30:54,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:30:54,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:30:54,224 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:30:54,224 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:30:54,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:30:54,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:30:54,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:30:54,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:30:54,225 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/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 -> 83a0614c205e8509abb6374f77d17b7065a071e3abf638495a02812bdb5a5d68 [2025-03-17 02:30:54,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:30:54,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:30:54,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:30:54,485 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:30:54,486 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:30:54,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i [2025-03-17 02:30:55,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483367a82/917ed8cd935d436aaedf68e937855523/FLAG6993a15fe [2025-03-17 02:30:55,873 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:30:55,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i [2025-03-17 02:30:55,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483367a82/917ed8cd935d436aaedf68e937855523/FLAG6993a15fe [2025-03-17 02:30:55,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483367a82/917ed8cd935d436aaedf68e937855523 [2025-03-17 02:30:55,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:30:55,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:30:55,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:30:55,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:30:55,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:30:55,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:55" (1/1) ... [2025-03-17 02:30:55,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ed8872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:55, skipping insertion in model container [2025-03-17 02:30:55,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:55" (1/1) ... [2025-03-17 02:30:55,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:30:56,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i[913,926] [2025-03-17 02:30:56,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:30:56,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:30:56,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i[913,926] [2025-03-17 02:30:56,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:30:56,150 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:30:56,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56 WrapperNode [2025-03-17 02:30:56,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:30:56,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:30:56,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:30:56,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:30:56,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,193 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-17 02:30:56,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:30:56,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:30:56,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:30:56,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:30:56,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,226 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-03-17 02:30:56,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:30:56,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:30:56,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:30:56,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:30:56,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (1/1) ... [2025-03-17 02:30:56,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:30:56,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:56,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:30:56,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:30:56,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:30:56,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:30:56,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:30:56,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:30:56,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:30:56,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:30:56,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:30:56,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:31:03,565 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:31:03,565 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:31:03,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:31:03,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:31:03,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:31:03 BoogieIcfgContainer [2025-03-17 02:31:03,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:31:03,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:31:03,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:31:03,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:31:03,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:30:55" (1/3) ... [2025-03-17 02:31:03,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633f9b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:31:03, skipping insertion in model container [2025-03-17 02:31:03,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:56" (2/3) ... [2025-03-17 02:31:03,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633f9b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:31:03, skipping insertion in model container [2025-03-17 02:31:03,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:31:03" (3/3) ... [2025-03-17 02:31:03,581 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-30.i [2025-03-17 02:31:03,591 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:31:03,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-30.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:31:03,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:31:03,642 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;@27fef232, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:31:03,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:31:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:31:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 02:31:03,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:31:03,651 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:31:03,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:31:03,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:31:03,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1085216637, now seen corresponding path program 1 times [2025-03-17 02:31:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:31:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887987236] [2025-03-17 02:31:03,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:31:03,663 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-03-17 02:31:03,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:31:03,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:31:03,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:31:03,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 02:31:04,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 02:31:04,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:31:04,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:31:04,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:31:04,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:31:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 02:31:04,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:31:04,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:31:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887987236] [2025-03-17 02:31:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887987236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:31:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:31:04,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:31:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787927502] [2025-03-17 02:31:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:31:04,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:31:04,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:31:04,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:31:04,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:31:04,099 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 02:31:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:31:04,115 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2025-03-17 02:31:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:31:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2025-03-17 02:31:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:31:04,122 INFO L225 Difference]: With dead ends: 87 [2025-03-17 02:31:04,123 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 02:31:04,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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-03-17 02:31:04,129 INFO L435 NwaCegarLoop]: 65 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, 65 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-03-17 02:31:04,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:31:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 02:31:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 02:31:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:31:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2025-03-17 02:31:04,179 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 71 [2025-03-17 02:31:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:31:04,179 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2025-03-17 02:31:04,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 02:31:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2025-03-17 02:31:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 02:31:04,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:31:04,182 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:31:04,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:31:04,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:31:04,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:31:04,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:31:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2065790625, now seen corresponding path program 1 times [2025-03-17 02:31:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:31:04,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164324813] [2025-03-17 02:31:04,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:31:04,384 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-03-17 02:31:04,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:31:04,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:31:04,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:31:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 02:31:04,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 02:31:04,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:31:04,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:31:04,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 02:31:04,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:31:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:31:05,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:31:05,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:31:05,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164324813] [2025-03-17 02:31:05,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164324813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:31:05,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:31:05,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:31:05,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429183586] [2025-03-17 02:31:05,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:31:05,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:31:05,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:31:05,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:31:05,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:31:05,491 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:31:09,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:13,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:17,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:21,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:25,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:31:25,972 INFO L93 Difference]: Finished difference Result 144 states and 220 transitions. [2025-03-17 02:31:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:31:26,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-03-17 02:31:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:31:26,011 INFO L225 Difference]: With dead ends: 144 [2025-03-17 02:31:26,011 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 02:31:26,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:31:26,012 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:31:26,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 199 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 15 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2025-03-17 02:31:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 02:31:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2025-03-17 02:31:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:31:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-03-17 02:31:26,027 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 71 [2025-03-17 02:31:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:31:26,027 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-03-17 02:31:26,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:31:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-03-17 02:31:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 02:31:26,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:31:26,030 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:31:26,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:31:26,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:31:26,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:31:26,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:31:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash -547331514, now seen corresponding path program 1 times [2025-03-17 02:31:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:31:26,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289525582] [2025-03-17 02:31:26,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:31:26,233 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-03-17 02:31:26,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:31:26,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:31:26,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 02:31:26,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 02:31:26,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 02:31:26,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:31:26,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:31:26,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 02:31:26,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:31:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:31:28,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:31:28,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:31:28,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289525582] [2025-03-17 02:31:28,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289525582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:31:28,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:31:28,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:31:28,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452581809] [2025-03-17 02:31:28,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:31:28,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:31:28,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:31:28,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:31:28,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:31:28,149 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:31:29,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:33,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:35,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:39,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:43,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:47,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:49,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:51,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:54,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:58,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:31:58,770 INFO L93 Difference]: Finished difference Result 223 states and 337 transitions. [2025-03-17 02:31:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:31:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2025-03-17 02:31:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:31:58,811 INFO L225 Difference]: With dead ends: 223 [2025-03-17 02:31:58,811 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 02:31:58,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:31:58,812 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 59 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:31:58,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 150 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 30.5s Time] [2025-03-17 02:31:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 02:31:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 107. [2025-03-17 02:31:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:31:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2025-03-17 02:31:58,830 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 72 [2025-03-17 02:31:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:31:58,830 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2025-03-17 02:31:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:31:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2025-03-17 02:31:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 02:31:58,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:31:58,832 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:31:58,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 02:31:59,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:31:59,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:31:59,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:31:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash -676414233, now seen corresponding path program 1 times [2025-03-17 02:31:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:31:59,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890445815] [2025-03-17 02:31:59,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:31:59,033 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-03-17 02:31:59,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:31:59,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:31:59,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 02:31:59,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 02:31:59,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 02:31:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:31:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:31:59,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:31:59,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:32:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 02:32:01,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:32:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 02:32:02,003 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:32:02,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890445815] [2025-03-17 02:32:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890445815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:32:02,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 02:32:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2025-03-17 02:32:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387135307] [2025-03-17 02:32:02,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 02:32:02,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:32:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:32:02,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:32:02,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:32:02,005 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 02:32:07,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:32:11,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:32:15,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:32:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:32:15,546 INFO L93 Difference]: Finished difference Result 173 states and 240 transitions. [2025-03-17 02:32:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:32:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 72 [2025-03-17 02:32:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:32:15,548 INFO L225 Difference]: With dead ends: 173 [2025-03-17 02:32:15,548 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 02:32:15,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:32:15,549 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 125 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:32:15,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 155 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 2 Unknown, 0 Unchecked, 12.9s Time] [2025-03-17 02:32:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 02:32:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 02:32:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 91 states have internal predecessors, (114), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:32:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2025-03-17 02:32:15,569 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 72 [2025-03-17 02:32:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:32:15,570 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2025-03-17 02:32:15,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-17 02:32:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2025-03-17 02:32:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 02:32:15,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:32:15,571 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:32:15,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 02:32:15,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:32:15,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:32:15,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:32:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1785795391, now seen corresponding path program 1 times [2025-03-17 02:32:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:32:15,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46952880] [2025-03-17 02:32:15,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:32:15,773 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-03-17 02:32:15,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:32:15,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:32:15,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 02:32:15,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 02:32:16,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 02:32:16,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:32:16,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:32:16,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 02:32:16,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:32:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 02:32:16,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:32:16,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:32:16,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46952880] [2025-03-17 02:32:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46952880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:32:16,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:32:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:32:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172285454] [2025-03-17 02:32:16,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:32:16,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:32:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:32:16,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:32:16,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:32:16,178 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:32:20,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:32:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:32:20,854 INFO L93 Difference]: Finished difference Result 229 states and 308 transitions. [2025-03-17 02:32:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:32:20,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2025-03-17 02:32:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:32:20,856 INFO L225 Difference]: With dead ends: 229 [2025-03-17 02:32:20,856 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 02:32:20,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:32:20,857 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:32:20,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-17 02:32:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 02:32:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 02:32:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:32:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 172 transitions. [2025-03-17 02:32:20,877 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 172 transitions. Word has length 73 [2025-03-17 02:32:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:32:20,878 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 172 transitions. [2025-03-17 02:32:20,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 02:32:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2025-03-17 02:32:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 02:32:20,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:32:20,879 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:32:20,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 02:32:21,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:32:21,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:32:21,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:32:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2000679893, now seen corresponding path program 1 times [2025-03-17 02:32:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:32:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53636264] [2025-03-17 02:32:21,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:32:21,081 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-03-17 02:32:21,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:32:21,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:32:21,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 02:32:21,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 02:32:21,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 02:32:21,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:32:21,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:32:21,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 02:32:21,469 INFO L279 TraceCheckSpWp]: Computing forward predicates...