./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_variablewrapping_normal_file-69.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 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:08:54,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:08:54,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:08:54,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:08:54,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:08:54,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:08:54,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:08:54,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:08:54,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:08:54,994 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:08:54,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:08:54,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:08:54,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:08:54,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:08:54,995 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:08:54,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:08:54,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:08:54,996 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:08:54,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:08:54,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:08:54,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:08:54,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:08:54,997 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:08:54,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:08:54,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:08:54,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:08:54,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:08:54,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:08:54,998 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 -> 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c [2025-03-08 16:08:55,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:08:55,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:08:55,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:08:55,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:08:55,237 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:08:55,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2025-03-08 16:08:56,367 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754191d7d/53aaa6c471cf4afa940ceb3a23493d32/FLAG37462ba1e [2025-03-08 16:08:56,621 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:08:56,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2025-03-08 16:08:56,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754191d7d/53aaa6c471cf4afa940ceb3a23493d32/FLAG37462ba1e [2025-03-08 16:08:56,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754191d7d/53aaa6c471cf4afa940ceb3a23493d32 [2025-03-08 16:08:56,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:08:56,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:08:56,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:08:56,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:08:56,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:08:56,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:08:56" (1/1) ... [2025-03-08 16:08:56,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b49f2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:56, skipping insertion in model container [2025-03-08 16:08:56,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:08:56" (1/1) ... [2025-03-08 16:08:56,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:08:57,063 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_variablewrapping_normal_file-69.i[913,926] [2025-03-08 16:08:57,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:08:57,116 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:08:57,124 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_variablewrapping_normal_file-69.i[913,926] [2025-03-08 16:08:57,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:08:57,158 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:08:57,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57 WrapperNode [2025-03-08 16:08:57,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:08:57,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:08:57,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:08:57,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:08:57,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,195 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-08 16:08:57,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:08:57,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:08:57,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:08:57,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:08:57,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,214 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-08 16:08:57,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:08:57,233 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:08:57,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:08:57,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:08:57,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (1/1) ... [2025-03-08 16:08:57,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:08:57,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:08:57,263 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-08 16:08:57,269 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-08 16:08:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:08:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:08:57,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:08:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:08:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:08:57,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:08:57,329 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:08:57,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:08:57,488 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 16:08:57,489 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:08:57,495 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:08:57,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:08:57,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:08:57 BoogieIcfgContainer [2025-03-08 16:08:57,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:08:57,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:08:57,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:08:57,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:08:57,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:08:56" (1/3) ... [2025-03-08 16:08:57,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665cb7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:08:57, skipping insertion in model container [2025-03-08 16:08:57,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:08:57" (2/3) ... [2025-03-08 16:08:57,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665cb7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:08:57, skipping insertion in model container [2025-03-08 16:08:57,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:08:57" (3/3) ... [2025-03-08 16:08:57,502 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-69.i [2025-03-08 16:08:57,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:08:57,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-69.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:08:57,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:08:57,564 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;@7238da3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:08:57,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:08:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:08:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 16:08:57,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:08:57,577 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:08:57,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:08:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:08:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1020140868, now seen corresponding path program 1 times [2025-03-08 16:08:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:08:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817122376] [2025-03-08 16:08:57,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:08:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:08:57,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:08:57,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:08:57,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:08:57,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:08:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:08:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:08:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817122376] [2025-03-08 16:08:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817122376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:08:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920676801] [2025-03-08 16:08:57,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:08:57,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:08:57,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:08:57,782 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-08 16:08:57,783 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-08 16:08:57,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:08:57,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:08:57,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:08:57,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:08:57,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:08:57,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:08:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:08:57,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:08:57,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920676801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:08:57,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:08:57,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:08:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849417717] [2025-03-08 16:08:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:08:57,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:08:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:08:57,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:08:57,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:08:57,963 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:08:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:08:57,981 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2025-03-08 16:08:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:08:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-03-08 16:08:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:08:57,990 INFO L225 Difference]: With dead ends: 96 [2025-03-08 16:08:57,990 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 16:08:57,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-08 16:08:57,996 INFO L435 NwaCegarLoop]: 70 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, 70 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-08 16:08:58,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:08:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 16:08:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 16:08:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:08:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2025-03-08 16:08:58,029 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 97 [2025-03-08 16:08:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:08:58,029 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2025-03-08 16:08:58,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:08:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2025-03-08 16:08:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 16:08:58,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:08:58,036 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:08:58,044 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-08 16:08:58,237 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-08 16:08:58,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:08:58,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:08:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 501171677, now seen corresponding path program 1 times [2025-03-08 16:08:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:08:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083873013] [2025-03-08 16:08:58,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:08:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:08:58,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:08:58,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:08:58,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:08:58,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:08:58,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985959544] [2025-03-08 16:08:58,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:08:58,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:08:58,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:08:58,359 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-08 16:08:58,360 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-08 16:08:58,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:08:58,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:08:58,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:08:58,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:08:58,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:08:58,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:08:58,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:08:58,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:08:58,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:08:58,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:08:58,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:08:58,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:08:58,546 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-08 16:08:58,739 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,SelfDestructingSolverStorable1 [2025-03-08 16:08:58,742 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 16:08:58,772 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:08:58,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:08:58 BoogieIcfgContainer [2025-03-08 16:08:58,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:08:58,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:08:58,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:08:58,776 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:08:58,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:08:57" (3/4) ... [2025-03-08 16:08:58,778 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:08:58,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:08:58,779 INFO L158 Benchmark]: Toolchain (without parser) took 1826.13ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 86.8MB in the end (delta: 20.9MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-03-08 16:08:58,779 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:08:58,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.83ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 95.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:08:58,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.46ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:08:58,780 INFO L158 Benchmark]: Boogie Preprocessor took 30.70ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:08:58,780 INFO L158 Benchmark]: IcfgBuilder took 262.05ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 76.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:08:58,780 INFO L158 Benchmark]: TraceAbstraction took 1277.64ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 87.6MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:08:58,780 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 86.8MB in the end (delta: 792.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:08:58,781 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.83ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 95.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.46ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.70ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 262.05ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 76.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1277.64ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 87.6MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 86.8MB in the end (delta: 792.3kB). 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 someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -100; [L23] unsigned long int var_1_2 = 0; [L24] unsigned long int var_1_3 = 8; [L25] unsigned long int var_1_4 = 256; [L26] unsigned long int var_1_5 = 500; [L27] signed char var_1_7 = -64; [L28] signed char var_1_8 = -8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 4.625; [L32] double var_1_13 = 15.5; VAL [isInitial=0, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_2=0, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L76] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L78] var_1_3 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L79] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L81] var_1_4 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L84] var_1_5 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L86] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L87] var_1_8 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L90] var_1_9 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L93] var_1_10 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L96] var_1_13 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L36] COND TRUE var_1_2 < (((((var_1_4 * var_1_5)) > (var_1_3)) ? ((var_1_4 * var_1_5)) : (var_1_3))) [L37] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=1, var_1_3=2, var_1_4=-4294967295, var_1_5=8589934592, var_1_7=0, var_1_8=0, var_1_9=0] [L49] unsigned long int stepLocal_1 = var_1_5; [L50] unsigned long int stepLocal_0 = var_1_2 * ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))); VAL [isInitial=1, stepLocal_0=-4294967295, stepLocal_1=8589934592, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=1, var_1_3=2, var_1_4=-4294967295, var_1_5=8589934592, var_1_7=0, var_1_8=0, var_1_9=0] [L51] COND FALSE !(stepLocal_0 < var_1_5) VAL [isInitial=1, stepLocal_1=8589934592, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=1, var_1_3=2, var_1_4=-4294967295, var_1_5=8589934592, var_1_7=0, var_1_8=0, var_1_9=0] [L58] unsigned char stepLocal_3 = var_1_9; [L59] signed long int stepLocal_2 = var_1_1 + var_1_7; VAL [isInitial=1, stepLocal_1=8589934592, stepLocal_2=-100, stepLocal_3=0, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=1, var_1_3=2, var_1_4=-4294967295, var_1_5=8589934592, var_1_7=0, var_1_8=0, var_1_9=0] [L60] COND FALSE !(((var_1_7 + var_1_8) == var_1_4) && stepLocal_3) [L71] var_1_11 = var_1_13 VAL [isInitial=1, stepLocal_1=8589934592, stepLocal_2=-100, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=1, var_1_3=2, var_1_4=-4294967295, var_1_5=8589934592, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_2 * ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < var_1_5) ? ((var_1_5 > var_1_2) ? (var_1_1 == ((signed short int) var_1_7)) : (var_1_1 == ((signed short int) var_1_7))) : 1) && ((var_1_2 < (((((var_1_4 * var_1_5)) > (var_1_3)) ? ((var_1_4 * var_1_5)) : (var_1_3)))) ? (var_1_7 == ((signed char) var_1_8)) : ((var_1_9 || var_1_10) ? (var_1_7 == ((signed char) var_1_8)) : ((var_1_3 < var_1_4) ? (var_1_7 == ((signed char) var_1_8)) : (var_1_7 == ((signed char) -4)))))) && ((((var_1_7 + var_1_8) == var_1_4) && var_1_9) ? ((! var_1_10) ? (((var_1_1 + var_1_7) != var_1_8) ? (var_1_11 == ((double) var_1_13)) : (var_1_11 == ((double) var_1_13))) : (var_1_11 == ((double) var_1_13))) : (var_1_11 == ((double) var_1_13))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=1, var_1_3=2, var_1_4=-4294967295, var_1_5=8589934592, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=1, var_1_3=2, var_1_4=-4294967295, var_1_5=8589934592, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=1, var_1_3=2, var_1_4=-4294967295, var_1_5=8589934592, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 70 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 812/840 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-08 16:08:58,797 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_variablewrapping_normal_file-69.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 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:09:00,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:09:00,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:09:00,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:09:00,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:09:00,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:09:00,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:09:00,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:09:00,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:09:00,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:09:00,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:09:00,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:09:00,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:09:00,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:09:00,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:09:00,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:09:00,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:09:00,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:09:00,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:09:00,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:09:00,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:09:00,766 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:09:00,766 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:09:00,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:09:00,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:09:00,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:09:00,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:09:00,766 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 -> 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c [2025-03-08 16:09:01,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:09:01,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:09:01,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:09:01,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:09:01,017 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:09:01,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2025-03-08 16:09:02,319 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f10b0bac/ee3ddf8228ec4d32b06036dbf7ece956/FLAG229fcfb4f [2025-03-08 16:09:02,530 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:09:02,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2025-03-08 16:09:02,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f10b0bac/ee3ddf8228ec4d32b06036dbf7ece956/FLAG229fcfb4f [2025-03-08 16:09:02,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f10b0bac/ee3ddf8228ec4d32b06036dbf7ece956 [2025-03-08 16:09:02,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:09:02,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:09:02,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:09:02,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:09:02,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:09:02,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669e8997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02, skipping insertion in model container [2025-03-08 16:09:02,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:09:02,692 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_variablewrapping_normal_file-69.i[913,926] [2025-03-08 16:09:02,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:09:02,730 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:09:02,742 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_variablewrapping_normal_file-69.i[913,926] [2025-03-08 16:09:02,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:09:02,782 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:09:02,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02 WrapperNode [2025-03-08 16:09:02,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:09:02,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:09:02,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:09:02,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:09:02,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,812 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-03-08 16:09:02,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:09:02,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:09:02,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:09:02,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:09:02,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,831 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-08 16:09:02,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:09:02,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:09:02,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:09:02,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:09:02,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (1/1) ... [2025-03-08 16:09:02,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:09:02,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:09:02,875 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-08 16:09:02,879 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-08 16:09:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:09:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:09:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:09:02,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:09:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:09:02,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:09:02,956 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:09:02,958 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:09:03,187 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 16:09:03,187 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:09:03,194 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:09:03,194 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:09:03,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:09:03 BoogieIcfgContainer [2025-03-08 16:09:03,195 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:09:03,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:09:03,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:09:03,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:09:03,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:09:02" (1/3) ... [2025-03-08 16:09:03,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1cefe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:09:03, skipping insertion in model container [2025-03-08 16:09:03,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:02" (2/3) ... [2025-03-08 16:09:03,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1cefe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:09:03, skipping insertion in model container [2025-03-08 16:09:03,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:09:03" (3/3) ... [2025-03-08 16:09:03,202 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-69.i [2025-03-08 16:09:03,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:09:03,214 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-69.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:09:03,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:09:03,260 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;@1eaea815, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:09:03,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:09:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:09:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 16:09:03,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:03,271 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:09:03,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:03,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1020140868, now seen corresponding path program 1 times [2025-03-08 16:09:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:09:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287205568] [2025-03-08 16:09:03,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:03,283 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-08 16:09:03,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:09:03,286 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-08 16:09:03,287 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-08 16:09:03,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:09:03,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:09:03,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:03,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:03,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:09:03,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 16:09:03,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:09:03,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:09:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287205568] [2025-03-08 16:09:03,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287205568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:09:03,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:09:03,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:09:03,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791071114] [2025-03-08 16:09:03,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:09:03,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:09:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:09:03,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:09:03,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:09:03,487 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:09:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:09:03,510 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2025-03-08 16:09:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:09:03,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-03-08 16:09:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:09:03,518 INFO L225 Difference]: With dead ends: 96 [2025-03-08 16:09:03,519 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 16:09:03,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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-08 16:09:03,525 INFO L435 NwaCegarLoop]: 70 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, 70 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-08 16:09:03,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:09:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 16:09:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 16:09:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:09:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2025-03-08 16:09:03,577 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 97 [2025-03-08 16:09:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:09:03,577 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2025-03-08 16:09:03,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:09:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2025-03-08 16:09:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 16:09:03,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:03,582 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:09:03,589 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-08 16:09:03,783 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-08 16:09:03,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:03,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash 501171677, now seen corresponding path program 1 times [2025-03-08 16:09:03,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:09:03,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384929934] [2025-03-08 16:09:03,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:03,786 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-08 16:09:03,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:09:03,788 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-08 16:09:03,789 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-08 16:09:03,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:09:03,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:09:03,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:03,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:03,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:09:03,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:09:19,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:09:19,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:09:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384929934] [2025-03-08 16:09:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384929934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:09:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:09:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:09:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846216977] [2025-03-08 16:09:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:09:19,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:09:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:09:19,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:09:19,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:09:19,119 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:09:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:09:24,157 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2025-03-08 16:09:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:09:24,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-08 16:09:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:09:24,164 INFO L225 Difference]: With dead ends: 81 [2025-03-08 16:09:24,164 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 16:09:24,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:09:24,165 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 119 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:09:24,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 211 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 16:09:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 16:09:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2025-03-08 16:09:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:09:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2025-03-08 16:09:24,173 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 97 [2025-03-08 16:09:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:09:24,173 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2025-03-08 16:09:24,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:09:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2025-03-08 16:09:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:09:24,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:24,174 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:09:24,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:09:24,379 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-08 16:09:24,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:24,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1858050893, now seen corresponding path program 1 times [2025-03-08 16:09:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:09:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236625233] [2025-03-08 16:09:24,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:24,380 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-08 16:09:24,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:09:24,383 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-08 16:09:24,384 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-08 16:09:24,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:09:24,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:09:24,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:24,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:24,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 16:09:24,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:09:34,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:09:34,881 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:09:34,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236625233] [2025-03-08 16:09:34,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236625233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:09:34,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:09:34,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:09:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563784764] [2025-03-08 16:09:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:09:34,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:09:34,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:09:34,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:09:34,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:09:34,882 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:09:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:09:37,140 INFO L93 Difference]: Finished difference Result 79 states and 108 transitions. [2025-03-08 16:09:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:09:37,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-03-08 16:09:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:09:37,144 INFO L225 Difference]: With dead ends: 79 [2025-03-08 16:09:37,144 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 16:09:37,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:09:37,144 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 109 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:09:37,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 216 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 16:09:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 16:09:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2025-03-08 16:09:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:09:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2025-03-08 16:09:37,151 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 98 [2025-03-08 16:09:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:09:37,151 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2025-03-08 16:09:37,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:09:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2025-03-08 16:09:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 16:09:37,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:37,153 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:09:37,158 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-08 16:09:37,353 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-08 16:09:37,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:37,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash -886261141, now seen corresponding path program 1 times [2025-03-08 16:09:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:09:37,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418746450] [2025-03-08 16:09:37,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:37,355 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-08 16:09:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:09:37,358 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-08 16:09:37,358 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-08 16:09:37,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 16:09:37,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 16:09:37,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:37,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:37,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 16:09:37,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:09:45,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:09:45,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:09:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418746450] [2025-03-08 16:09:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418746450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:09:45,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:09:45,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:09:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238473717] [2025-03-08 16:09:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:09:45,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:09:45,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:09:45,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:09:45,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:09:45,607 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:09:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:09:51,249 INFO L93 Difference]: Finished difference Result 94 states and 128 transitions. [2025-03-08 16:09:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:09:51,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-03-08 16:09:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:09:51,256 INFO L225 Difference]: With dead ends: 94 [2025-03-08 16:09:51,256 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 16:09:51,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:09:51,257 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 151 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:09:51,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 235 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 16:09:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 16:09:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2025-03-08 16:09:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:09:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2025-03-08 16:09:51,263 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 98 [2025-03-08 16:09:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:09:51,263 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2025-03-08 16:09:51,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:09:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2025-03-08 16:09:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:09:51,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:51,264 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:09:51,270 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-08 16:09:51,465 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-08 16:09:51,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:51,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1797306495, now seen corresponding path program 1 times [2025-03-08 16:09:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:09:51,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498932896] [2025-03-08 16:09:51,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:51,466 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-08 16:09:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:09:51,468 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-08 16:09:51,468 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-08 16:09:51,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:09:51,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:09:51,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:51,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:51,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:09:51,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:09:56,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:09:56,142 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:09:56,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498932896] [2025-03-08 16:09:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498932896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:09:56,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:09:56,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:09:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719220562] [2025-03-08 16:09:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:09:56,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:09:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:09:56,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:09:56,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:09:56,143 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:00,345 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2025-03-08 16:10:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:10:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-08 16:10:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:00,348 INFO L225 Difference]: With dead ends: 92 [2025-03-08 16:10:00,348 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 16:10:00,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:10:00,349 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 106 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:00,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 272 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 16:10:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 16:10:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2025-03-08 16:10:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:10:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2025-03-08 16:10:00,358 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 99 [2025-03-08 16:10:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:00,358 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2025-03-08 16:10:00,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2025-03-08 16:10:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:10:00,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:00,359 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:10:00,365 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-08 16:10:00,559 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-08 16:10:00,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:00,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1933534304, now seen corresponding path program 1 times [2025-03-08 16:10:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:10:00,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985900269] [2025-03-08 16:10:00,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:00,560 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-08 16:10:00,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:10:00,562 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-08 16:10:00,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 16:10:00,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:10:00,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:10:00,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:00,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:00,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 16:10:00,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:10:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:10:05,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:10:05,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:10:05,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985900269] [2025-03-08 16:10:05,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985900269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:05,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:10:05,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:10:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681946860] [2025-03-08 16:10:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:05,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:10:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:10:05,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:10:05,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:10:05,040 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:12,535 INFO L93 Difference]: Finished difference Result 164 states and 230 transitions. [2025-03-08 16:10:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:10:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-08 16:10:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:12,540 INFO L225 Difference]: With dead ends: 164 [2025-03-08 16:10:12,540 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 16:10:12,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:10:12,542 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 132 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:12,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 319 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 16:10:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 16:10:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2025-03-08 16:10:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:10:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2025-03-08 16:10:12,550 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 99 [2025-03-08 16:10:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:12,550 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2025-03-08 16:10:12,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2025-03-08 16:10:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 16:10:12,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:12,552 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:10:12,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 16:10:12,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:12,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:12,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:12,753 INFO L85 PathProgramCache]: Analyzing trace with hash 126079841, now seen corresponding path program 1 times [2025-03-08 16:10:12,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:10:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807079979] [2025-03-08 16:10:12,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:12,753 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-08 16:10:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:10:12,755 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:10:12,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 16:10:12,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 16:10:12,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 16:10:12,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:12,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:12,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 16:10:12,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:10:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:10:16,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:10:16,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:10:16,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807079979] [2025-03-08 16:10:16,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807079979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:16,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:10:16,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:10:16,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252809923] [2025-03-08 16:10:16,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:16,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:10:16,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:10:16,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:10:16,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:10:16,305 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:21,133 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2025-03-08 16:10:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:10:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-08 16:10:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:21,137 INFO L225 Difference]: With dead ends: 114 [2025-03-08 16:10:21,137 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 16:10:21,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:10:21,138 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 120 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:21,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 327 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 16:10:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 16:10:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 65. [2025-03-08 16:10:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:10:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2025-03-08 16:10:21,148 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 99 [2025-03-08 16:10:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:21,148 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2025-03-08 16:10:21,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2025-03-08 16:10:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 16:10:21,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:21,149 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:10:21,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-08 16:10:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:21,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:21,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash -983347926, now seen corresponding path program 1 times [2025-03-08 16:10:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:10:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465263295] [2025-03-08 16:10:21,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:21,351 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-08 16:10:21,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:10:21,353 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:10:21,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-08 16:10:21,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:10:21,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:10:21,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:21,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:21,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:10:21,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:10:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:10:24,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:10:24,423 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:10:24,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465263295] [2025-03-08 16:10:24,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465263295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:24,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:10:24,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:10:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647488762] [2025-03-08 16:10:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:24,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:10:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:10:24,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:10:24,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:10:24,425 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:27,604 INFO L93 Difference]: Finished difference Result 112 states and 150 transitions. [2025-03-08 16:10:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:10:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-03-08 16:10:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:27,606 INFO L225 Difference]: With dead ends: 112 [2025-03-08 16:10:27,606 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 16:10:27,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:10:27,607 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:27,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 296 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 16:10:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 16:10:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 68. [2025-03-08 16:10:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:10:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2025-03-08 16:10:27,614 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 100 [2025-03-08 16:10:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:27,614 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2025-03-08 16:10:27,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2025-03-08 16:10:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 16:10:27,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:27,615 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:10:27,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-08 16:10:27,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:27,816 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:27,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1179861431, now seen corresponding path program 1 times [2025-03-08 16:10:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:10:27,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121733948] [2025-03-08 16:10:27,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:27,816 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-08 16:10:27,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:10:27,819 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:10:27,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 16:10:27,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 16:10:27,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 16:10:27,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:27,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:27,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:10:27,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:10:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:10:30,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:10:30,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:10:30,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121733948] [2025-03-08 16:10:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121733948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:10:30,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:10:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789749223] [2025-03-08 16:10:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:30,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:10:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:10:30,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:10:30,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:10:30,512 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:33,750 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2025-03-08 16:10:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:10:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-03-08 16:10:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:33,752 INFO L225 Difference]: With dead ends: 103 [2025-03-08 16:10:33,752 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 16:10:33,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:10:33,753 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 112 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:33,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 312 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 16:10:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 16:10:33,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 16:10:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 16:10:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 16:10:33,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2025-03-08 16:10:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:33,754 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 16:10:33,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:10:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 16:10:33,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 16:10:33,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:10:33,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-08 16:10:33,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:33,961 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:10:33,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 16:10:34,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:10:34,697 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 16:10:34,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 16:10:34,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 16:10:34,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 16:10:34,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-08 16:10:34,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 16:10:34,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:10:34 BoogieIcfgContainer [2025-03-08 16:10:34,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:10:34,700 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:10:34,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:10:34,701 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:10:34,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:09:03" (3/4) ... [2025-03-08 16:10:34,704 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 16:10:34,708 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 16:10:34,711 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 16:10:34,712 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 16:10:34,712 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 16:10:34,712 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 16:10:34,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 16:10:34,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 16:10:34,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:10:34,772 INFO L158 Benchmark]: Toolchain (without parser) took 92212.63ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 92.7MB in the beginning and 435.8MB in the end (delta: -343.1MB). Peak memory consumption was 377.4MB. Max. memory is 16.1GB. [2025-03-08 16:10:34,773 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:10:34,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.81ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 79.6MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:10:34,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.84ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:10:34,774 INFO L158 Benchmark]: Boogie Preprocessor took 27.07ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:10:34,774 INFO L158 Benchmark]: IcfgBuilder took 349.81ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 60.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:10:34,774 INFO L158 Benchmark]: TraceAbstraction took 91502.86ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 60.4MB in the beginning and 440.2MB in the end (delta: -379.8MB). Peak memory consumption was 335.5MB. Max. memory is 16.1GB. [2025-03-08 16:10:34,774 INFO L158 Benchmark]: Witness Printer took 71.74ms. Allocated memory is still 838.9MB. Free memory was 440.2MB in the beginning and 435.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:10:34,775 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.58ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.81ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 79.6MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.84ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.07ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 349.81ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 60.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 91502.86ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 60.4MB in the beginning and 440.2MB in the end (delta: -379.8MB). Peak memory consumption was 335.5MB. Max. memory is 16.1GB. * Witness Printer took 71.74ms. Allocated memory is still 838.9MB. Free memory was 440.2MB in the beginning and 435.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 90.7s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 36.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 995 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 987 mSDsluCounter, 2258 SdHoareTripleChecker+Invalid, 18.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1751 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3603 IncrementalHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 507 mSDtfsCounter, 3603 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 964 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=8, InterpolantAutomatonStates: 128, 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, 9 MinimizatonAttempts, 216 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 52.0s InterpolantComputationTime, 887 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 878 ConstructedInterpolants, 0 QuantifiedInterpolants, 5997 SizeOfPredicates, 96 NumberOfNonLiveVariables, 1435 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3780/3780 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 16:10:34,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE