./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.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 d62049a8671dc4126607d95338b3f088a05730ad2ea95c2a5aaf3301f472a609 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:40:07,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:40:07,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:40:07,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:40:07,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:40:07,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:40:07,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:40:07,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:40:07,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:40:07,185 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:40:07,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:40:07,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:40:07,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:40:07,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:40:07,186 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:40:07,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:40:07,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:40:07,186 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:40:07,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:40:07,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:40:07,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:40:07,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:40:07,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:40:07,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:40:07,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:40:07,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:40:07,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:40:07,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:40:07,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:40:07,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:40:07,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:40:07,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:40:07,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:40:07,191 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 -> d62049a8671dc4126607d95338b3f088a05730ad2ea95c2a5aaf3301f472a609 [2025-03-17 02:40:07,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:40:07,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:40:07,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:40:07,428 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:40:07,428 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:40:07,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i [2025-03-17 02:40:08,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae15a0403/699e0b0d175b417dadeed4401a118749/FLAG6c0cc519f [2025-03-17 02:40:08,967 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:40:08,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i [2025-03-17 02:40:08,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae15a0403/699e0b0d175b417dadeed4401a118749/FLAG6c0cc519f [2025-03-17 02:40:08,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae15a0403/699e0b0d175b417dadeed4401a118749 [2025-03-17 02:40:08,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:40:08,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:40:08,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:40:08,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:40:08,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:40:08,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:40:08" (1/1) ... [2025-03-17 02:40:08,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7382e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:08, skipping insertion in model container [2025-03-17 02:40:08,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:40:08" (1/1) ... [2025-03-17 02:40:09,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:40:09,102 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_floatingpointinfluence_has-floats_file-16.i[917,930] [2025-03-17 02:40:09,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:40:09,137 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:40:09,144 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_floatingpointinfluence_has-floats_file-16.i[917,930] [2025-03-17 02:40:09,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:40:09,169 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:40:09,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09 WrapperNode [2025-03-17 02:40:09,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:40:09,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:40:09,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:40:09,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:40:09,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,199 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-17 02:40:09,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:40:09,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:40:09,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:40:09,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:40:09,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,230 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:40:09,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:40:09,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:40:09,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:40:09,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:40:09,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (1/1) ... [2025-03-17 02:40:09,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:40:09,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:40:09,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:40:09,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:40:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:40:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:40:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:40:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:40:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:40:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:40:09,361 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:40:09,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:40:09,560 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:40:09,560 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:40:09,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:40:09,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:40:09,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:40:09 BoogieIcfgContainer [2025-03-17 02:40:09,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:40:09,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:40:09,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:40:09,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:40:09,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:40:08" (1/3) ... [2025-03-17 02:40:09,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153e8e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:40:09, skipping insertion in model container [2025-03-17 02:40:09,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:09" (2/3) ... [2025-03-17 02:40:09,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153e8e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:40:09, skipping insertion in model container [2025-03-17 02:40:09,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:40:09" (3/3) ... [2025-03-17 02:40:09,575 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-16.i [2025-03-17 02:40:09,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:40:09,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-16.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:40:09,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:40:09,644 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;@7e60758d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:40:09,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:40:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 02:40:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 02:40:09,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:40:09,660 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:40:09,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:40:09,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:40:09,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1125556996, now seen corresponding path program 1 times [2025-03-17 02:40:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:40:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587262006] [2025-03-17 02:40:09,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:40:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:40:09,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:09,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:09,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:09,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:40:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 02:40:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:40:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587262006] [2025-03-17 02:40:09,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587262006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:40:09,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381455589] [2025-03-17 02:40:09,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:40:09,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:40:09,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:40:09,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:40:09,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:40:09,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:10,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:10,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:10,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:40:10,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:40:10,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:40:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 02:40:10,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:40:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381455589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:40:10,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:40:10,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:40:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095990145] [2025-03-17 02:40:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:40:10,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:40:10,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:40:10,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:40:10,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:40:10,122 INFO L87 Difference]: Start difference. First operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 02:40:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:40:10,147 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2025-03-17 02:40:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:40:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 125 [2025-03-17 02:40:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:40:10,157 INFO L225 Difference]: With dead ends: 101 [2025-03-17 02:40:10,158 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 02:40:10,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:40:10,164 INFO L435 NwaCegarLoop]: 76 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, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:40:10,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:40:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 02:40:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 02:40:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 02:40:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2025-03-17 02:40:10,225 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 125 [2025-03-17 02:40:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:40:10,225 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2025-03-17 02:40:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 02:40:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2025-03-17 02:40:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 02:40:10,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:40:10,233 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:40:10,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:40:10,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:40:10,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:40:10,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:40:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1125668191, now seen corresponding path program 1 times [2025-03-17 02:40:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:40:10,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120358721] [2025-03-17 02:40:10,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:40:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:40:10,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:10,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:10,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:10,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:40:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-03-17 02:40:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:40:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120358721] [2025-03-17 02:40:12,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120358721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:40:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107915362] [2025-03-17 02:40:12,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:40:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:40:12,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:40:12,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:40:12,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:40:12,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:12,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:12,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:12,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:40:12,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:40:12,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:40:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 312 proven. 96 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-17 02:40:13,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:40:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107915362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:40:37,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 02:40:37,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-03-17 02:40:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897309505] [2025-03-17 02:40:37,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 02:40:37,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 02:40:37,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:40:37,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 02:40:37,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=182, Unknown=2, NotChecked=0, Total=240 [2025-03-17 02:40:37,975 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-17 02:40:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:40:42,227 INFO L93 Difference]: Finished difference Result 166 states and 242 transitions. [2025-03-17 02:40:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 02:40:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 125 [2025-03-17 02:40:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:40:42,231 INFO L225 Difference]: With dead ends: 166 [2025-03-17 02:40:42,231 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 02:40:42,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=186, Invalid=514, Unknown=2, NotChecked=0, Total=702 [2025-03-17 02:40:42,233 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 101 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:40:42,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 325 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 02:40:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 02:40:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2025-03-17 02:40:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:40:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-03-17 02:40:42,252 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 125 [2025-03-17 02:40:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:40:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-03-17 02:40:42,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-17 02:40:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-03-17 02:40:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 02:40:42,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:40:42,254 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:40:42,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:40:42,455 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-17 02:40:42,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:40:42,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:40:42,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1426488770, now seen corresponding path program 1 times [2025-03-17 02:40:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:40:42,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649438680] [2025-03-17 02:40:42,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:40:42,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:40:42,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:42,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:42,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:42,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:40:42,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999205990] [2025-03-17 02:40:42,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:40:42,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:40:42,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:40:42,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:40:42,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 02:40:42,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:42,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:42,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:42,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:40:42,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:40:42,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:42,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:42,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:42,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:40:42,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:40:42,770 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:40:42,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:40:42,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 02:40:42,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:40:42,978 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 02:40:43,050 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:40:43,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:40:43 BoogieIcfgContainer [2025-03-17 02:40:43,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:40:43,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:40:43,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:40:43,056 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:40:43,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:40:09" (3/4) ... [2025-03-17 02:40:43,059 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:40:43,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:40:43,060 INFO L158 Benchmark]: Toolchain (without parser) took 34072.48ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 111.5MB in the beginning and 316.6MB in the end (delta: -205.1MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2025-03-17 02:40:43,060 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:40:43,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.99ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:40:43,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.34ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:40:43,061 INFO L158 Benchmark]: Boogie Preprocessor took 42.75ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 94.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:40:43,061 INFO L158 Benchmark]: IcfgBuilder took 321.61ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 78.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:40:43,062 INFO L158 Benchmark]: TraceAbstraction took 33484.70ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 77.6MB in the beginning and 316.7MB in the end (delta: -239.0MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2025-03-17 02:40:43,062 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 427.8MB. Free memory was 316.7MB in the beginning and 316.6MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:40:43,063 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.28ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.99ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.34ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.75ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 94.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 321.61ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 78.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33484.70ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 77.6MB in the beginning and 316.7MB in the end (delta: -239.0MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 427.8MB. Free memory was 316.7MB in the beginning and 316.6MB in the end (delta: 87.1kB). 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 someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_3 = 4; [L24] signed short int var_1_4 = 256; [L25] unsigned char var_1_5 = 0; [L26] unsigned char var_1_6 = 1; [L27] float var_1_7 = 1000000.8; [L28] float var_1_8 = 3.8; [L29] signed char var_1_9 = 25; [L30] float var_1_10 = 2.75; [L31] signed char var_1_11 = 0; [L32] signed char var_1_12 = 32; [L33] signed char var_1_13 = 2; [L34] signed char var_1_14 = 2; [L35] signed short int var_1_15 = -32; [L36] signed char last_1_var_1_9 = 25; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_9 = var_1_9 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L69] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L69] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L70] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L70] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L71] var_1_4 = __VERIFIER_nondet_short() [L72] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L72] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L73] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L74] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L76] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L77] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L77] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L79] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L80] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L80] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L81] var_1_8 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L82] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L83] var_1_10 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L84] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L85] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L85] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L90] RET assume_abort_if_not(var_1_12 >= 31) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L92] var_1_13 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L93] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L94] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L94] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L95] var_1_14 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L96] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L97] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L97] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L111] RET updateVariables() [L112] CALL step() [L40] COND FALSE !((last_1_var_1_9 % ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) <= -1000000) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L43] var_1_7 = var_1_8 [L44] signed char stepLocal_2 = var_1_11; [L45] unsigned char stepLocal_1 = 99999.375 <= var_1_10; VAL [isInitial=1, last_1_var_1_9=25, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L46] COND FALSE !(var_1_13 <= stepLocal_2) [L51] var_1_15 = -25 VAL [isInitial=1, last_1_var_1_9=25, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L53] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_9=25, stepLocal_0=1, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L54] COND FALSE !(var_1_8 < (var_1_7 / var_1_10)) VAL [isInitial=1, last_1_var_1_9=25, stepLocal_0=1, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((((last_1_var_1_9 % ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) <= -1000000) ? (var_1_1 == ((unsigned char) (var_1_5 || var_1_6))) : 1) && (var_1_7 == ((float) var_1_8))) && ((var_1_8 < (var_1_7 / var_1_10)) ? ((var_1_1 || var_1_6) ? (var_1_9 == ((signed char) ((((((var_1_11) > (5)) ? (var_1_11) : (5))) + (var_1_12 - var_1_13)) - var_1_14))) : ((var_1_10 > var_1_8) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_12)))) : 1)) && ((var_1_13 <= var_1_11) ? (((var_1_8 < var_1_7) && (99999.375 <= var_1_10)) ? (var_1_15 == ((signed short int) (var_1_13 + var_1_14))) : 1) : (var_1_15 == ((signed short int) -25))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=24, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 101 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 401 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 307 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 130 mSDtfsCounter, 307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 496 ConstructedInterpolants, 0 QuantifiedInterpolants, 2738 SizeOfPredicates, 4 NumberOfNonLiveVariables, 578 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3128/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:40:43,273 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-17 02:40:43,339 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 137 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_floatingpointinfluence_has-floats_file-16.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 d62049a8671dc4126607d95338b3f088a05730ad2ea95c2a5aaf3301f472a609 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:40:45,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:40:45,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:40:45,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:40:45,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:40:45,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:40:45,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:40:45,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:40:45,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:40:45,719 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:40:45,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:40:45,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:40:45,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:40:45,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:40:45,719 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:40:45,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:40:45,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:40:45,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:40:45,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:40:45,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:40:45,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:40:45,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:40:45,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:40:45,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:40:45,722 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 -> d62049a8671dc4126607d95338b3f088a05730ad2ea95c2a5aaf3301f472a609 [2025-03-17 02:40:46,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:40:46,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:40:46,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:40:46,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:40:46,164 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:40:46,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i [2025-03-17 02:40:47,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd286af14/b8a1671f859b45cbace12a25dc468759/FLAGec1f6967c [2025-03-17 02:40:47,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:40:47,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-16.i [2025-03-17 02:40:47,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd286af14/b8a1671f859b45cbace12a25dc468759/FLAGec1f6967c [2025-03-17 02:40:47,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd286af14/b8a1671f859b45cbace12a25dc468759 [2025-03-17 02:40:47,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:40:47,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:40:47,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:40:47,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:40:47,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:40:47,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:47,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a871274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47, skipping insertion in model container [2025-03-17 02:40:47,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:47,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:40:47,897 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_floatingpointinfluence_has-floats_file-16.i[917,930] [2025-03-17 02:40:47,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:40:47,955 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:40:47,964 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_floatingpointinfluence_has-floats_file-16.i[917,930] [2025-03-17 02:40:47,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:40:47,996 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:40:47,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47 WrapperNode [2025-03-17 02:40:47,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:40:47,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:40:47,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:40:47,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:40:48,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,036 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-17 02:40:48,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:40:48,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:40:48,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:40:48,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:40:48,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,063 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:40:48,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:40:48,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:40:48,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:40:48,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:40:48,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (1/1) ... [2025-03-17 02:40:48,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:40:48,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:40:48,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:40:48,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:40:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:40:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:40:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:40:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:40:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:40:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:40:48,212 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:40:48,213 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:40:50,904 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:40:50,905 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:40:50,916 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:40:50,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:40:50,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:40:50 BoogieIcfgContainer [2025-03-17 02:40:50,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:40:50,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:40:50,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:40:50,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:40:50,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:40:47" (1/3) ... [2025-03-17 02:40:50,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6465780d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:40:50, skipping insertion in model container [2025-03-17 02:40:50,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:47" (2/3) ... [2025-03-17 02:40:50,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6465780d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:40:50, skipping insertion in model container [2025-03-17 02:40:50,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:40:50" (3/3) ... [2025-03-17 02:40:50,929 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-16.i [2025-03-17 02:40:50,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:40:50,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-16.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:40:50,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:40:51,004 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;@1b0a4120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:40:51,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:40:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 02:40:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 02:40:51,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:40:51,017 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:40:51,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:40:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:40:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1125556996, now seen corresponding path program 1 times [2025-03-17 02:40:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:40:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678369333] [2025-03-17 02:40:51,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:40:51,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:40:51,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:40:51,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:40:51,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:40:51,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:51,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:51,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:51,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:40:51,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:40:51,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:40:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 02:40:51,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:40:51,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:40:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678369333] [2025-03-17 02:40:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678369333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:40:51,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:40:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:40:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063430440] [2025-03-17 02:40:51,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:40:51,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:40:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:40:51,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:40:51,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:40:51,476 INFO L87 Difference]: Start difference. First operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:40:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:40:51,500 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2025-03-17 02:40:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:40:51,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 125 [2025-03-17 02:40:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:40:51,507 INFO L225 Difference]: With dead ends: 101 [2025-03-17 02:40:51,507 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 02:40:51,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:40:51,513 INFO L435 NwaCegarLoop]: 75 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, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:40:51,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:40:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 02:40:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 02:40:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 02:40:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2025-03-17 02:40:51,552 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 125 [2025-03-17 02:40:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:40:51,553 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2025-03-17 02:40:51,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:40:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2025-03-17 02:40:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 02:40:51,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:40:51,556 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:40:51,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:40:51,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:40:51,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:40:51,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:40:51,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1426488770, now seen corresponding path program 1 times [2025-03-17 02:40:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:40:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256463840] [2025-03-17 02:40:51,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:40:51,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:40:51,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:40:51,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:40:51,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:40:51,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:40:52,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:40:52,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:40:52,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:40:52,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 02:40:52,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:41:22,168 WARN L286 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)