./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-57.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 b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:56:10,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:56:10,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:56:10,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:56:10,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:56:10,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:56:10,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:56:10,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:56:10,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:56:10,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:56:10,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:56:10,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:56:10,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:56:10,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:56:10,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:56:10,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:56:10,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:56:10,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:56:10,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:56:10,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:56:10,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:56:10,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:56:10,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:56:10,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:56:10,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:56:10,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:56:10,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:56:10,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:56:10,101 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 -> b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 [2025-03-04 00:56:10,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:56:10,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:56:10,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:56:10,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:56:10,329 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:56:10,331 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-57.i [2025-03-04 00:56:11,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd473ac01/4557cd51496b48d4be471687f8ad2a9a/FLAG503fd90ce [2025-03-04 00:56:11,752 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:56:11,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2025-03-04 00:56:11,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd473ac01/4557cd51496b48d4be471687f8ad2a9a/FLAG503fd90ce [2025-03-04 00:56:12,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd473ac01/4557cd51496b48d4be471687f8ad2a9a [2025-03-04 00:56:12,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:56:12,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:56:12,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:56:12,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:56:12,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:56:12,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74071be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12, skipping insertion in model container [2025-03-04 00:56:12,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:56:12,213 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-57.i[913,926] [2025-03-04 00:56:12,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:56:12,263 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:56:12,272 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-57.i[913,926] [2025-03-04 00:56:12,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:56:12,308 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:56:12,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12 WrapperNode [2025-03-04 00:56:12,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:56:12,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:56:12,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:56:12,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:56:12,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,341 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-04 00:56:12,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:56:12,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:56:12,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:56:12,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:56:12,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,369 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-04 00:56:12,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:56:12,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:56:12,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:56:12,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:56:12,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (1/1) ... [2025-03-04 00:56:12,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:56:12,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:56:12,415 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-04 00:56:12,418 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-04 00:56:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:56:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:56:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:56:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:56:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:56:12,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:56:12,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:56:12,479 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:56:12,652 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 00:56:12,652 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:56:12,664 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:56:12,664 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:56:12,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:12 BoogieIcfgContainer [2025-03-04 00:56:12,665 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:56:12,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:56:12,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:56:12,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:56:12,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:56:12" (1/3) ... [2025-03-04 00:56:12,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8fb0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:12, skipping insertion in model container [2025-03-04 00:56:12,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:12" (2/3) ... [2025-03-04 00:56:12,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8fb0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:12, skipping insertion in model container [2025-03-04 00:56:12,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:12" (3/3) ... [2025-03-04 00:56:12,672 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-57.i [2025-03-04 00:56:12,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:56:12,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-57.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:56:12,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:56:12,743 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;@6748d7fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:56:12,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:56:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:56:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 00:56:12,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:12,759 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:12,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:12,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1797623301, now seen corresponding path program 1 times [2025-03-04 00:56:12,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:12,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557680131] [2025-03-04 00:56:12,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:12,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 00:56:12,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 00:56:12,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:12,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 00:56:13,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:56:13,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557680131] [2025-03-04 00:56:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557680131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:56:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588422986] [2025-03-04 00:56:13,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:56:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:56:13,003 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-04 00:56:13,004 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-04 00:56:13,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 00:56:13,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 00:56:13,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:13,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:13,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:56:13,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 00:56:13,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:56:13,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588422986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:13,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:56:13,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:56:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633243106] [2025-03-04 00:56:13,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:56:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:56:13,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:56:13,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:56:13,176 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:56:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:13,195 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2025-03-04 00:56:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:56:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-03-04 00:56:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:13,200 INFO L225 Difference]: With dead ends: 98 [2025-03-04 00:56:13,201 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 00:56:13,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-04 00:56:13,205 INFO L435 NwaCegarLoop]: 71 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, 71 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-04 00:56:13,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:56:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 00:56:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 00:56:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:56:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-03-04 00:56:13,241 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 113 [2025-03-04 00:56:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:13,242 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-03-04 00:56:13,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:56:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-03-04 00:56:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 00:56:13,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:13,246 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:13,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:56:13,447 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-04 00:56:13,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:13,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1151472997, now seen corresponding path program 1 times [2025-03-04 00:56:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100491788] [2025-03-04 00:56:13,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:13,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 00:56:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 00:56:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 00:56:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:56:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100491788] [2025-03-04 00:56:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100491788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:13,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:13,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:56:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828477862] [2025-03-04 00:56:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:56:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:56:13,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:56:13,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:56:13,697 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 00:56:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:13,832 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2025-03-04 00:56:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:56:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2025-03-04 00:56:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:13,835 INFO L225 Difference]: With dead ends: 142 [2025-03-04 00:56:13,836 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 00:56:13,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:56:13,837 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 40 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:56:13,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 189 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:56:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 00:56:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2025-03-04 00:56:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 00:56:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2025-03-04 00:56:13,853 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 113 [2025-03-04 00:56:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2025-03-04 00:56:13,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 00:56:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2025-03-04 00:56:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 00:56:13,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:13,858 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:13,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:56:13,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:13,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322250, now seen corresponding path program 1 times [2025-03-04 00:56:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:13,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728126946] [2025-03-04 00:56:13,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:13,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:13,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 00:56:13,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 00:56:13,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:13,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:56:13,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:56:13,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 00:56:14,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 00:56:14,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:14,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:56:14,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:56:14,065 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:56:14,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:56:14,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:56:14,069 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:56:14,125 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:56:14,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:56:14 BoogieIcfgContainer [2025-03-04 00:56:14,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:56:14,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:56:14,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:56:14,129 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:56:14,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:12" (3/4) ... [2025-03-04 00:56:14,131 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:56:14,131 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:56:14,132 INFO L158 Benchmark]: Toolchain (without parser) took 2035.91ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 100.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2025-03-04 00:56:14,132 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:56:14,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.66ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:56:14,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.67ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:56:14,133 INFO L158 Benchmark]: Boogie Preprocessor took 40.01ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:56:14,133 INFO L158 Benchmark]: IcfgBuilder took 282.35ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 77.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:56:14,134 INFO L158 Benchmark]: TraceAbstraction took 1461.92ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 100.4MB in the end (delta: -23.2MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-03-04 00:56:14,134 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 100.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:56:14,134 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.66ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.67ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.01ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 282.35ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 77.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1461.92ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 100.4MB in the end (delta: -23.2MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 100.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 1; [L26] signed char var_1_9 = 64; [L27] signed char var_1_10 = 4; [L28] signed char var_1_11 = -4; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 32; [L31] signed char var_1_14 = -64; [L32] signed char var_1_15 = 50; [L33] signed char var_1_16 = 16; [L34] float var_1_17 = 63.5; [L35] signed char last_1_var_1_9 = 64; [L36] signed char last_1_var_1_14 = -64; VAL [isInitial=0, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_9 = var_1_9 [L98] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L68] var_1_4 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L69] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L70] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_6=1, var_1_9=64] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_6=1, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_9=64] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_9=64] [L74] var_1_6 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_9=64] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L76] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L77] var_1_10 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L78] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L79] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L79] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L80] var_1_11 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L81] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L82] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L82] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L84] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L89] var_1_15 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L91] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L91] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L94] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L94] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L109] RET updateVariables() [L110] CALL step() [L40] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L41] COND TRUE ! (last_1_var_1_14 >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L42] COND TRUE (var_1_4 || var_1_5) && stepLocal_0 [L43] var_1_1 = ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L50] signed long int stepLocal_3 = (var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))); VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L51] COND TRUE var_1_12 < stepLocal_3 [L52] var_1_14 = ((64 - var_1_16) - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L56] var_1_17 = 128.91f [L57] unsigned char stepLocal_2 = var_1_14 == var_1_1; [L58] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_1=-255, stepLocal_2=0, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L59] COND FALSE !(stepLocal_1 && var_1_4) [L64] var_1_9 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_2=0, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=-127] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? (((var_1_4 || var_1_5) && var_1_6) ? (var_1_1 == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : (var_1_1 == ((signed long int) last_1_var_1_14))) : (var_1_1 == ((signed long int) last_1_var_1_14))) && ((var_1_5 && var_1_4) ? ((var_1_6 || (var_1_14 == var_1_1)) ? (var_1_9 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))) : 1) : (var_1_9 == ((signed char) (var_1_12 - var_1_13))))) && ((var_1_12 < ((var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))))) ? (var_1_14 == ((signed char) ((64 - var_1_16) - var_1_13))) : (var_1_14 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))))) && (var_1_17 == ((float) 128.91f)) ; VAL [\result=0, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=-127] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=-127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=-127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 137 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 453 NumberOfCodeBlocks, 453 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 269 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1802/1836 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-04 00:56:14,148 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-57.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 b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:56:15,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:56:15,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:56:15,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:56:15,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:56:15,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:56:15,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:56:15,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:56:15,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:56:15,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:56:15,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:56:15,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:56:15,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:56:15,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:56:15,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:56:15,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:56:15,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:56:15,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:56:15,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:56:15,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:56:15,988 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:56:15,988 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:56:15,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:56:15,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:56:15,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:56:15,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:56:15,988 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 -> b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 [2025-03-04 00:56:16,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:56:16,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:56:16,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:56:16,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:56:16,249 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:56:16,250 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-57.i [2025-03-04 00:56:17,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ebae21d/ab1f189bbd204bcebcce3d5dc331652a/FLAG65a20d907 [2025-03-04 00:56:17,552 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:56:17,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2025-03-04 00:56:17,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ebae21d/ab1f189bbd204bcebcce3d5dc331652a/FLAG65a20d907 [2025-03-04 00:56:17,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ebae21d/ab1f189bbd204bcebcce3d5dc331652a [2025-03-04 00:56:17,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:56:17,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:56:17,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:56:17,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:56:17,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:56:17,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c2b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17, skipping insertion in model container [2025-03-04 00:56:17,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:56:17,699 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-57.i[913,926] [2025-03-04 00:56:17,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:56:17,752 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:56:17,760 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-57.i[913,926] [2025-03-04 00:56:17,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:56:17,795 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:56:17,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17 WrapperNode [2025-03-04 00:56:17,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:56:17,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:56:17,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:56:17,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:56:17,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,830 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-04 00:56:17,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:56:17,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:56:17,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:56:17,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:56:17,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,856 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-04 00:56:17,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:56:17,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:56:17,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:56:17,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:56:17,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (1/1) ... [2025-03-04 00:56:17,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:56:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:56:17,914 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-04 00:56:17,918 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-04 00:56:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:56:17,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:56:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:56:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:56:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:56:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:56:17,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:56:17,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:56:18,205 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 00:56:18,209 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:56:18,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:56:18,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:56:18,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:18 BoogieIcfgContainer [2025-03-04 00:56:18,217 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:56:18,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:56:18,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:56:18,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:56:18,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:56:17" (1/3) ... [2025-03-04 00:56:18,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d824b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:18, skipping insertion in model container [2025-03-04 00:56:18,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:17" (2/3) ... [2025-03-04 00:56:18,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d824b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:18, skipping insertion in model container [2025-03-04 00:56:18,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:18" (3/3) ... [2025-03-04 00:56:18,224 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-57.i [2025-03-04 00:56:18,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:56:18,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-57.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:56:18,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:56:18,276 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;@596136ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:56:18,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:56:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:56:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 00:56:18,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:18,288 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:18,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:18,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1797623301, now seen corresponding path program 1 times [2025-03-04 00:56:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:56:18,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386527120] [2025-03-04 00:56:18,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:18,305 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-04 00:56:18,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:56:18,307 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-04 00:56:18,310 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-04 00:56:18,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 00:56:18,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 00:56:18,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:18,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:18,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:56:18,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 00:56:18,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:56:18,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:56:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386527120] [2025-03-04 00:56:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386527120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:56:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993736564] [2025-03-04 00:56:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:18,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:56:18,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:56:18,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:56:18,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:56:18,499 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:56:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:18,524 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2025-03-04 00:56:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:56:18,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-03-04 00:56:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:18,529 INFO L225 Difference]: With dead ends: 98 [2025-03-04 00:56:18,529 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 00:56:18,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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-04 00:56:18,533 INFO L435 NwaCegarLoop]: 71 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, 71 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-04 00:56:18,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:56:18,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 00:56:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 00:56:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:56:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-03-04 00:56:18,568 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 113 [2025-03-04 00:56:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:18,568 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-03-04 00:56:18,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:56:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-03-04 00:56:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 00:56:18,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:18,573 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:18,578 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-04 00:56:18,777 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-04 00:56:18,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:18,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:18,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1151472997, now seen corresponding path program 1 times [2025-03-04 00:56:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:56:18,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403826595] [2025-03-04 00:56:18,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:18,783 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-04 00:56:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:56:18,785 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-04 00:56:18,785 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-04 00:56:18,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 00:56:18,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 00:56:18,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:18,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:18,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:56:18,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 00:56:19,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:56:19,446 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:56:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403826595] [2025-03-04 00:56:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403826595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:19,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:19,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:56:19,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417256741] [2025-03-04 00:56:19,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:19,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:56:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:56:19,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:56:19,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:56:19,448 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 00:56:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:19,577 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2025-03-04 00:56:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:56:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2025-03-04 00:56:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:19,579 INFO L225 Difference]: With dead ends: 142 [2025-03-04 00:56:19,579 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 00:56:19,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:56:19,580 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 37 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:56:19,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 189 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:56:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 00:56:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2025-03-04 00:56:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 00:56:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2025-03-04 00:56:19,603 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 113 [2025-03-04 00:56:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:19,605 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2025-03-04 00:56:19,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 00:56:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2025-03-04 00:56:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 00:56:19,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:19,606 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:19,611 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-04 00:56:19,807 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-04 00:56:19,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:19,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:19,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322250, now seen corresponding path program 1 times [2025-03-04 00:56:19,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:56:19,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447934532] [2025-03-04 00:56:19,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:19,811 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-04 00:56:19,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:56:19,813 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-04 00:56:19,814 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-04 00:56:19,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 00:56:19,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 00:56:19,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:19,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:19,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 00:56:19,931 INFO L279 TraceCheckSpWp]: Computing forward predicates...