./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.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 f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:02:03,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:02:03,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:02:03,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:02:03,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:02:03,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:02:03,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:02:03,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:02:03,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:02:03,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:02:03,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:02:03,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:02:03,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:02:03,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:02:03,326 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:02:03,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:02:03,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:02:03,328 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:02:03,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:02:03,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:02:03,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:02:03,329 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 -> f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 [2025-03-08 16:02:03,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:02:03,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:02:03,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:02:03,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:02:03,565 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:02:03,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i [2025-03-08 16:02:04,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61278fe0/dbcb888502ba4ce98502d3e200d2862a/FLAGf5aca956b [2025-03-08 16:02:05,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:02:05,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i [2025-03-08 16:02:05,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61278fe0/dbcb888502ba4ce98502d3e200d2862a/FLAGf5aca956b [2025-03-08 16:02:05,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61278fe0/dbcb888502ba4ce98502d3e200d2862a [2025-03-08 16:02:05,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:02:05,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:02:05,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:02:05,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:02:05,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:02:05,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05, skipping insertion in model container [2025-03-08 16:02:05,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:02:05,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i[913,926] [2025-03-08 16:02:05,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:02:05,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:02:05,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i[913,926] [2025-03-08 16:02:05,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:02:05,242 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:02:05,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05 WrapperNode [2025-03-08 16:02:05,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:02:05,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:02:05,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:02:05,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:02:05,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,277 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-08 16:02:05,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:02:05,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:02:05,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:02:05,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:02:05,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:02:05,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:02:05,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:02:05,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:02:05,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:02:05,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (1/1) ... [2025-03-08 16:02:05,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:02:05,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:02:05,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:02:05,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:02:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:02:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:02:05,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:02:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:02:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:02:05,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:02:05,420 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:02:05,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:02:05,614 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 16:02:05,615 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:02:05,626 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:02:05,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:02:05,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:05 BoogieIcfgContainer [2025-03-08 16:02:05,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:02:05,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:02:05,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:02:05,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:02:05,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:02:05" (1/3) ... [2025-03-08 16:02:05,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbe36c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:05, skipping insertion in model container [2025-03-08 16:02:05,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:05" (2/3) ... [2025-03-08 16:02:05,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbe36c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:05, skipping insertion in model container [2025-03-08 16:02:05,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:05" (3/3) ... [2025-03-08 16:02:05,638 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-15.i [2025-03-08 16:02:05,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:02:05,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-15.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:02:05,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:02:05,711 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;@7406910b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:02:05,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:02:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 16:02:05,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:05,724 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:02:05,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:05,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash -583129431, now seen corresponding path program 1 times [2025-03-08 16:02:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:02:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318141598] [2025-03-08 16:02:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:05,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:02:05,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 16:02:05,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 16:02:05,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:05,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 16:02:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:02:05,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318141598] [2025-03-08 16:02:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318141598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:02:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070776081] [2025-03-08 16:02:05,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:05,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:02:05,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:02:05,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:02:05,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:02:06,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 16:02:06,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 16:02:06,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:06,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:06,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:02:06,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:02:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 16:02:06,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:02:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070776081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:06,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:02:06,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:02:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940536261] [2025-03-08 16:02:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:06,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:02:06,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:02:06,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:02:06,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:02:06,089 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:02:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:06,106 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-03-08 16:02:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:02:06,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-03-08 16:02:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:06,113 INFO L225 Difference]: With dead ends: 84 [2025-03-08 16:02:06,113 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 16:02:06,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:02:06,118 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:02:06,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:02:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 16:02:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 16:02:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-08 16:02:06,152 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2025-03-08 16:02:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:06,152 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-08 16:02:06,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:02:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-08 16:02:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 16:02:06,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:06,156 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:02:06,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:02:06,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:02:06,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:06,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 272391213, now seen corresponding path program 1 times [2025-03-08 16:02:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:02:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041485546] [2025-03-08 16:02:06,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:02:06,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 16:02:06,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 16:02:06,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:06,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:02:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:02:06,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041485546] [2025-03-08 16:02:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041485546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:06,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:02:06,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:02:06,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849468764] [2025-03-08 16:02:06,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:06,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:02:06,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:02:06,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:02:06,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:02:06,799 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:06,841 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2025-03-08 16:02:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:02:06,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-03-08 16:02:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:06,842 INFO L225 Difference]: With dead ends: 95 [2025-03-08 16:02:06,842 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 16:02:06,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:02:06,843 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:02:06,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:02:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 16:02:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2025-03-08 16:02:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2025-03-08 16:02:06,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 82 [2025-03-08 16:02:06,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:06,855 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2025-03-08 16:02:06,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2025-03-08 16:02:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 16:02:06,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:06,856 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:02:06,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:02:06,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:06,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash 207747085, now seen corresponding path program 1 times [2025-03-08 16:02:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:02:06,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006436689] [2025-03-08 16:02:06,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:02:06,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 16:02:06,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 16:02:06,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:06,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:02:06,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:02:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006436689] [2025-03-08 16:02:06,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006436689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:06,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:02:06,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:02:06,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364457345] [2025-03-08 16:02:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:06,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:02:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:02:06,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:02:06,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:02:06,953 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:06,980 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2025-03-08 16:02:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:02:06,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-03-08 16:02:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:06,983 INFO L225 Difference]: With dead ends: 127 [2025-03-08 16:02:06,983 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 16:02:06,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:02:06,984 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:02:06,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:02:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 16:02:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2025-03-08 16:02:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:02:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2025-03-08 16:02:07,012 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 82 [2025-03-08 16:02:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:07,012 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2025-03-08 16:02:07,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2025-03-08 16:02:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 16:02:07,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:07,013 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:02:07,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:02:07,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:07,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:07,016 INFO L85 PathProgramCache]: Analyzing trace with hash 857198358, now seen corresponding path program 1 times [2025-03-08 16:02:07,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:02:07,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875934634] [2025-03-08 16:02:07,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:07,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:02:07,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:02:07,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:02:07,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:07,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:02:07,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:02:07,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:02:07,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:02:07,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:07,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:02:07,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:02:07,162 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:02:07,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:02:07,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:02:07,169 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 16:02:07,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:02:07,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:02:07 BoogieIcfgContainer [2025-03-08 16:02:07,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:02:07,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:02:07,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:02:07,224 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:02:07,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:05" (3/4) ... [2025-03-08 16:02:07,226 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:02:07,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:02:07,228 INFO L158 Benchmark]: Toolchain (without parser) took 2196.16ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 84.7MB in the end (delta: 29.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-03-08 16:02:07,229 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:07,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.33ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 101.7MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:02:07,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.56ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:07,230 INFO L158 Benchmark]: Boogie Preprocessor took 41.43ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:07,230 INFO L158 Benchmark]: IcfgBuilder took 303.84ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 83.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:02:07,230 INFO L158 Benchmark]: TraceAbstraction took 1595.58ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 84.7MB in the end (delta: -995.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:07,231 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 84.7MB in the end (delta: 56.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:02:07,231 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.33ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 101.7MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.56ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.43ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 303.84ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 83.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1595.58ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 84.7MB in the end (delta: -995.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 84.7MB in the end (delta: 56.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = 8; [L26] unsigned long int var_1_8 = 1; [L27] unsigned long int var_1_9 = 1885310857; [L28] signed long int var_1_10 = -10; [L29] double var_1_11 = 32.6; [L30] double var_1_12 = 9.75; [L31] double var_1_13 = 5.1; [L32] double var_1_14 = 128.1; [L33] double var_1_15 = 63.9; [L34] signed long int last_1_var_1_10 = -10; VAL [isInitial=0, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L67] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L68] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L68] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L75] var_1_9 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_9 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L76] RET assume_abort_if_not(var_1_9 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L79] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L81] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L82] var_1_14 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L83] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L84] var_1_15 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L85] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=2147483647] [L99] RET updateVariables() [L100] CALL step() [L38] COND TRUE \read(var_1_2) [L39] var_1_8 = ((1514707036u + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) - last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] [L43] COND TRUE \read(var_1_2) [L44] var_1_10 = (var_1_8 + ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-632776601, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] [L46] unsigned char stepLocal_1 = var_1_2; [L47] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-632776601, stepLocal_1=-255, var_1_10=-632776601, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] [L48] COND TRUE stepLocal_1 || ((~ var_1_10) >= var_1_10) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-632776601, var_1_10=-632776601, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] [L49] COND FALSE !(stepLocal_0 < var_1_8) [L54] var_1_1 = 2 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-632776601, var_1_11=163/5, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] [L59] COND TRUE var_1_1 >= var_1_1 [L60] var_1_11 = (var_1_12 - (((((var_1_13 + var_1_14)) > (var_1_15)) ? ((var_1_13 + var_1_14)) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-632776601, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] [L100] RET step() [L101] CALL, EXPR property() [L91-L92] return ((((var_1_2 || ((~ var_1_10) >= var_1_10)) ? ((var_1_10 < var_1_8) ? ((! var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : 1) : (var_1_1 == ((signed char) 2))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_2 ? (var_1_8 == ((unsigned long int) ((1514707036u + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) - last_1_var_1_10))) : (var_1_8 == ((unsigned long int) ((((last_1_var_1_10) > (var_1_9)) ? (last_1_var_1_10) : (var_1_9))))))) && (var_1_2 ? (var_1_10 == ((signed long int) (var_1_8 + ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) : 1)) && ((var_1_1 >= var_1_1) ? (var_1_11 == ((double) (var_1_12 - (((((var_1_13 + var_1_14)) > (var_1_15)) ? ((var_1_13 + var_1_14)) : (var_1_15)))))) : (var_1_11 == ((double) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-10, var_1_10=-632776601, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-632776601, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-632776601, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=3662190693, var_1_9=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 76 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 186 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1034/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:02:07,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.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 f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:02:09,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:02:09,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:02:09,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:02:09,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:02:09,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:02:09,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:02:09,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:02:09,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:02:09,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:02:09,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:02:09,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:02:09,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:02:09,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:02:09,294 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:02:09,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:02:09,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:02:09,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:02:09,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:02:09,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:02:09,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:02:09,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:02:09,296 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:02:09,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:02:09,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:02:09,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:02:09,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:02:09,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:02:09,296 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 -> f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 [2025-03-08 16:02:09,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:02:09,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:02:09,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:02:09,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:02:09,560 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:02:09,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i [2025-03-08 16:02:10,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48b3c3a0/7f196f76254b43c88ec4e4256b96795c/FLAG02e95b90b [2025-03-08 16:02:11,041 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:02:11,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i [2025-03-08 16:02:11,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48b3c3a0/7f196f76254b43c88ec4e4256b96795c/FLAG02e95b90b [2025-03-08 16:02:11,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48b3c3a0/7f196f76254b43c88ec4e4256b96795c [2025-03-08 16:02:11,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:02:11,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:02:11,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:02:11,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:02:11,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:02:11,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de582cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11, skipping insertion in model container [2025-03-08 16:02:11,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:02:11,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i[913,926] [2025-03-08 16:02:11,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:02:11,249 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:02:11,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i[913,926] [2025-03-08 16:02:11,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:02:11,286 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:02:11,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11 WrapperNode [2025-03-08 16:02:11,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:02:11,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:02:11,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:02:11,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:02:11,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,318 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-08 16:02:11,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:02:11,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:02:11,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:02:11,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:02:11,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,344 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:02:11,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,349 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:02:11,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:02:11,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:02:11,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:02:11,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (1/1) ... [2025-03-08 16:02:11,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:02:11,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:02:11,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:02:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:02:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:02:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:02:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:02:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:02:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:02:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:02:11,461 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:02:11,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:02:13,133 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 16:02:13,133 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:02:13,140 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:02:13,140 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:02:13,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:13 BoogieIcfgContainer [2025-03-08 16:02:13,141 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:02:13,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:02:13,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:02:13,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:02:13,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:02:11" (1/3) ... [2025-03-08 16:02:13,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7804b4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:13, skipping insertion in model container [2025-03-08 16:02:13,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:11" (2/3) ... [2025-03-08 16:02:13,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7804b4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:13, skipping insertion in model container [2025-03-08 16:02:13,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:13" (3/3) ... [2025-03-08 16:02:13,148 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-15.i [2025-03-08 16:02:13,157 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:02:13,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-15.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:02:13,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:02:13,209 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;@28e34fde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:02:13,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:02:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 16:02:13,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:13,219 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:02:13,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:13,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash -583129431, now seen corresponding path program 1 times [2025-03-08 16:02:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:02:13,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622556340] [2025-03-08 16:02:13,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:13,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:02:13,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:02:13,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:02:13,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:02:13,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 16:02:13,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 16:02:13,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:13,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:13,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:02:13,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:02:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 16:02:13,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:02:13,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:02:13,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622556340] [2025-03-08 16:02:13,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622556340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:13,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:02:13,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:02:13,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464819444] [2025-03-08 16:02:13,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:13,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:02:13,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:02:13,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:02:13,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:02:13,538 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:02:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:13,560 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-03-08 16:02:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:02:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-03-08 16:02:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:13,567 INFO L225 Difference]: With dead ends: 84 [2025-03-08 16:02:13,567 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 16:02:13,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:02:13,572 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:02:13,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:02:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 16:02:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 16:02:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-08 16:02:13,599 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2025-03-08 16:02:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:13,600 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-08 16:02:13,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:02:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-08 16:02:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 16:02:13,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:13,602 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:02:13,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:02:13,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:02:13,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:13,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash 272391213, now seen corresponding path program 1 times [2025-03-08 16:02:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:02:13,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739298281] [2025-03-08 16:02:13,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:13,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:02:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:02:13,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:02:13,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:02:13,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 16:02:14,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 16:02:14,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:14,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:14,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:02:14,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:02:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-08 16:02:14,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:02:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:02:14,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:02:14,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739298281] [2025-03-08 16:02:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739298281] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:02:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:02:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 16:02:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453661199] [2025-03-08 16:02:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:14,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:02:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:02:14,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:02:14,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:02:14,420 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:15,140 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2025-03-08 16:02:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:02:15,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-03-08 16:02:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:15,153 INFO L225 Difference]: With dead ends: 95 [2025-03-08 16:02:15,153 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 16:02:15,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:02:15,154 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:02:15,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:02:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 16:02:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2025-03-08 16:02:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:02:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2025-03-08 16:02:15,160 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 82 [2025-03-08 16:02:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:15,161 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2025-03-08 16:02:15,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2025-03-08 16:02:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 16:02:15,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:15,163 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:02:15,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:02:15,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:02:15,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:15,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 207747085, now seen corresponding path program 1 times [2025-03-08 16:02:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:02:15,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227422117] [2025-03-08 16:02:15,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:15,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:02:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:02:15,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:02:15,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:02:15,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 16:02:15,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 16:02:15,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:15,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:15,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 16:02:15,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:02:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:02:15,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:02:15,762 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:02:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227422117] [2025-03-08 16:02:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227422117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:02:15,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:02:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:02:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335926039] [2025-03-08 16:02:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:02:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:02:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:02:15,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:02:15,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:02:15,764 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:02:16,485 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2025-03-08 16:02:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:02:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-03-08 16:02:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:02:16,488 INFO L225 Difference]: With dead ends: 127 [2025-03-08 16:02:16,488 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 16:02:16,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:02:16,488 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:02:16,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:02:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 16:02:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2025-03-08 16:02:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:02:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2025-03-08 16:02:16,499 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 82 [2025-03-08 16:02:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:02:16,499 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2025-03-08 16:02:16,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:02:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2025-03-08 16:02:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 16:02:16,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:02:16,500 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:02:16,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:02:16,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:02:16,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:02:16,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:02:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash 857198358, now seen corresponding path program 1 times [2025-03-08 16:02:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:02:16,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052373554] [2025-03-08 16:02:16,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:02:16,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:02:16,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:02:16,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:02:16,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:02:16,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:02:16,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:02:16,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:02:16,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:02:16,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 16:02:16,933 INFO L279 TraceCheckSpWp]: Computing forward predicates...