./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.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-83.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 adf694b6ddef665d6d08615d55edd3b888b46a164390930323ad37ea28078730 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:59:19,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:59:19,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:59:19,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:59:19,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:59:19,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:59:19,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:59:19,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:59:19,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:59:19,425 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:59:19,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:59:19,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:59:19,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:59:19,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:59:19,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:59:19,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:59:19,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:59:19,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:59:19,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:59:19,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:59:19,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:59:19,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:59:19,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:59:19,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:59:19,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:59:19,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:59:19,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:59:19,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:59:19,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:59:19,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:59:19,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:59:19,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:59:19,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:59:19,429 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 -> adf694b6ddef665d6d08615d55edd3b888b46a164390930323ad37ea28078730 [2025-03-04 00:59:19,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:59:19,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:59:19,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:59:19,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:59:19,656 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:59:19,657 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-83.i [2025-03-04 00:59:20,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24a61817/402733dfb6b241418b0f26ca7959450f/FLAG66a63e044 [2025-03-04 00:59:21,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:59:21,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i [2025-03-04 00:59:21,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24a61817/402733dfb6b241418b0f26ca7959450f/FLAG66a63e044 [2025-03-04 00:59:21,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24a61817/402733dfb6b241418b0f26ca7959450f [2025-03-04 00:59:21,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:59:21,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:59:21,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:59:21,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:59:21,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:59:21,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21, skipping insertion in model container [2025-03-04 00:59:21,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:59:21,183 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-83.i[913,926] [2025-03-04 00:59:21,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:59:21,215 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:59:21,225 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-83.i[913,926] [2025-03-04 00:59:21,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:59:21,265 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:59:21,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21 WrapperNode [2025-03-04 00:59:21,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:59:21,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:59:21,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:59:21,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:59:21,273 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:59:21" (1/1) ... [2025-03-04 00:59:21,279 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:59:21" (1/1) ... [2025-03-04 00:59:21,313 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-04 00:59:21,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:59:21,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:59:21,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:59:21,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:59:21,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,343 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:59:21,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:59:21,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:59:21,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:59:21,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:59:21,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (1/1) ... [2025-03-04 00:59:21,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:59:21,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:59:21,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:59:21,394 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:59:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:59:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:59:21,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:59:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:59:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:59:21,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:59:21,463 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:59:21,465 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:59:21,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~ite12#1;havoc property_#t~bitwise11#1;havoc property_#t~short13#1; [2025-03-04 00:59:21,667 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-04 00:59:21,667 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:59:21,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:59:21,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:59:21,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:59:21 BoogieIcfgContainer [2025-03-04 00:59:21,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:59:21,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:59:21,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:59:21,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:59:21,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:59:21" (1/3) ... [2025-03-04 00:59:21,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436cd7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:59:21, skipping insertion in model container [2025-03-04 00:59:21,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:21" (2/3) ... [2025-03-04 00:59:21,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436cd7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:59:21, skipping insertion in model container [2025-03-04 00:59:21,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:59:21" (3/3) ... [2025-03-04 00:59:21,686 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-83.i [2025-03-04 00:59:21,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:59:21,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-83.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:59:21,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:59:21,753 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;@7ea21064, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:59:21,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:59:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 00:59:21,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:21,764 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:21,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:21,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1252627508, now seen corresponding path program 1 times [2025-03-04 00:59:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886054463] [2025-03-04 00:59:21,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:21,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 00:59:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 00:59:21,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:21,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 00:59:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:59:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886054463] [2025-03-04 00:59:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886054463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:59:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366167257] [2025-03-04 00:59:21,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:21,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:59:21,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:59:21,947 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:59:21,949 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:59:21,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 00:59:22,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 00:59:22,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:22,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:22,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:59:22,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:59:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 00:59:22,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:59:22,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366167257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:59:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:59:22,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148100265] [2025-03-04 00:59:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:22,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:59:22,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:59:22,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:59:22,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:59:22,069 INFO L87 Difference]: Start difference. First operand has 55 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:59:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:22,088 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2025-03-04 00:59:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:59:22,090 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2025-03-04 00:59:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:22,094 INFO L225 Difference]: With dead ends: 104 [2025-03-04 00:59:22,095 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:59:22,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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:59:22,098 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:22,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:59:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:59:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:59:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-04 00:59:22,125 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 78 [2025-03-04 00:59:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:22,125 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-04 00:59:22,125 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:59:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-03-04 00:59:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 00:59:22,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:22,130 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:22,136 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:59:22,330 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:59:22,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:22,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash 755877432, now seen corresponding path program 1 times [2025-03-04 00:59:22,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558710201] [2025-03-04 00:59:22,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:22,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 00:59:22,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 00:59:22,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:22,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:59:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:59:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558710201] [2025-03-04 00:59:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558710201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:22,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:59:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192827654] [2025-03-04 00:59:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:59:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:59:22,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:59:22,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:59:22,478 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:22,504 INFO L93 Difference]: Finished difference Result 124 states and 178 transitions. [2025-03-04 00:59:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:59:22,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2025-03-04 00:59:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:22,506 INFO L225 Difference]: With dead ends: 124 [2025-03-04 00:59:22,506 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 00:59:22,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:59:22,507 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 66 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:22,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 128 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:59:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 00:59:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2025-03-04 00:59:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2025-03-04 00:59:22,525 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 78 [2025-03-04 00:59:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:22,527 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2025-03-04 00:59:22,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2025-03-04 00:59:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 00:59:22,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:22,530 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:22,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:59:22,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1005791199, now seen corresponding path program 1 times [2025-03-04 00:59:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:22,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257572645] [2025-03-04 00:59:22,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:22,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:59:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:59:22,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:22,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:59:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:59:22,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257572645] [2025-03-04 00:59:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257572645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:22,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:59:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944522969] [2025-03-04 00:59:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:59:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:59:22,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:59:22,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:59:22,722 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:22,770 INFO L93 Difference]: Finished difference Result 103 states and 144 transitions. [2025-03-04 00:59:22,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:59:22,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 79 [2025-03-04 00:59:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:22,772 INFO L225 Difference]: With dead ends: 103 [2025-03-04 00:59:22,772 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 00:59:22,772 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:59:22,774 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:22,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 178 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:59:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 00:59:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-04 00:59:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2025-03-04 00:59:22,783 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 79 [2025-03-04 00:59:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:22,783 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2025-03-04 00:59:22,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2025-03-04 00:59:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 00:59:22,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:22,784 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:22,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:59:22,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:22,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1428198188, now seen corresponding path program 1 times [2025-03-04 00:59:22,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:22,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404146304] [2025-03-04 00:59:22,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:22,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:22,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 00:59:22,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 00:59:22,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:22,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:59:25,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:59:25,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404146304] [2025-03-04 00:59:25,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404146304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:25,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:25,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:59:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64849073] [2025-03-04 00:59:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:25,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:59:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:59:25,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:59:25,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:59:25,820 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:26,416 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2025-03-04 00:59:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:59:26,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 80 [2025-03-04 00:59:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:26,418 INFO L225 Difference]: With dead ends: 136 [2025-03-04 00:59:26,419 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 00:59:26,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:59:26,420 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 96 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:26,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 202 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:59:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 00:59:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2025-03-04 00:59:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2025-03-04 00:59:26,431 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 80 [2025-03-04 00:59:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:26,431 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2025-03-04 00:59:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2025-03-04 00:59:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 00:59:26,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:26,435 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:59:26,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:26,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1309815774, now seen corresponding path program 1 times [2025-03-04 00:59:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214273217] [2025-03-04 00:59:26,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:26,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:59:26,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:59:26,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:26,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:59:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:59:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214273217] [2025-03-04 00:59:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214273217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:59:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455979833] [2025-03-04 00:59:27,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:27,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:59:27,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:59:27,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:59:27,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:59:27,152 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:27,400 INFO L93 Difference]: Finished difference Result 166 states and 220 transitions. [2025-03-04 00:59:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:59:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2025-03-04 00:59:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:27,402 INFO L225 Difference]: With dead ends: 166 [2025-03-04 00:59:27,402 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 00:59:27,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:59:27,403 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:27,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 359 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:59:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 00:59:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2025-03-04 00:59:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2025-03-04 00:59:27,414 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 81 [2025-03-04 00:59:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:27,417 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2025-03-04 00:59:27,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2025-03-04 00:59:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 00:59:27,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:27,418 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:27,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:59:27,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:27,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash 804257149, now seen corresponding path program 1 times [2025-03-04 00:59:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:27,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60635465] [2025-03-04 00:59:27,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:27,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:27,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:59:27,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:59:27,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:27,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:59:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:59:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60635465] [2025-03-04 00:59:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60635465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:28,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:28,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:59:28,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938901779] [2025-03-04 00:59:28,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:28,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:59:28,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:59:28,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:59:28,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:59:28,903 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:30,078 INFO L93 Difference]: Finished difference Result 165 states and 218 transitions. [2025-03-04 00:59:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:59:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2025-03-04 00:59:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:30,080 INFO L225 Difference]: With dead ends: 165 [2025-03-04 00:59:30,080 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 00:59:30,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:59:30,081 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 125 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:30,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 477 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:59:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 00:59:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2025-03-04 00:59:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2025-03-04 00:59:30,086 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 81 [2025-03-04 00:59:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:30,086 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2025-03-04 00:59:30,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2025-03-04 00:59:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 00:59:30,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:30,087 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:30,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:59:30,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:30,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1322339177, now seen corresponding path program 1 times [2025-03-04 00:59:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321750753] [2025-03-04 00:59:30,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:30,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:59:30,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:59:30,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:30,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:59:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:59:30,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321750753] [2025-03-04 00:59:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321750753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:30,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:59:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356786603] [2025-03-04 00:59:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:30,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:59:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:59:30,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:59:30,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:59:30,138 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:30,174 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2025-03-04 00:59:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:59:30,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 82 [2025-03-04 00:59:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:30,175 INFO L225 Difference]: With dead ends: 134 [2025-03-04 00:59:30,175 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 00:59:30,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:59:30,176 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:30,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:59:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 00:59:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2025-03-04 00:59:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-03-04 00:59:30,181 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 82 [2025-03-04 00:59:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:30,181 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-03-04 00:59:30,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-03-04 00:59:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 00:59:30,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:30,182 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:30,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:59:30,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:30,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:30,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1947406070, now seen corresponding path program 1 times [2025-03-04 00:59:30,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:30,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266959113] [2025-03-04 00:59:30,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:30,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:30,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:59:30,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:59:30,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:30,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:59:30,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:59:30,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266959113] [2025-03-04 00:59:30,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266959113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:30,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:30,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:59:30,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053129405] [2025-03-04 00:59:30,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:30,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:59:30,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:59:30,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:59:30,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:59:30,223 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:59:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:30,284 INFO L93 Difference]: Finished difference Result 150 states and 197 transitions. [2025-03-04 00:59:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:59:30,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 82 [2025-03-04 00:59:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:30,285 INFO L225 Difference]: With dead ends: 150 [2025-03-04 00:59:30,285 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 00:59:30,286 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:59:30,286 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 104 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:30,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 108 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:59:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 00:59:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2025-03-04 00:59:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-03-04 00:59:30,292 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 82 [2025-03-04 00:59:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:30,292 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-03-04 00:59:30,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:59:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-03-04 00:59:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 00:59:30,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:30,293 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:30,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:59:30,293 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:30,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash 595653909, now seen corresponding path program 1 times [2025-03-04 00:59:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:59:30,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946639035] [2025-03-04 00:59:30,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:59:30,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 00:59:30,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 00:59:30,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:30,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:59:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698064963] [2025-03-04 00:59:30,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:30,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:59:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:59:30,314 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:59:30,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:59:30,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 00:59:30,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 00:59:30,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:30,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:59:30,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:59:30,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 00:59:30,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 00:59:30,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:30,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:59:30,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:59:30,431 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:59:30,431 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:59:30,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:59:30,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 00:59:30,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:59:30,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:59:30,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:59:30 BoogieIcfgContainer [2025-03-04 00:59:30,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:59:30,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:59:30,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:59:30,697 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:59:30,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:59:21" (3/4) ... [2025-03-04 00:59:30,700 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:59:30,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:59:30,701 INFO L158 Benchmark]: Toolchain (without parser) took 9634.73ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 122.2MB in the beginning and 102.2MB in the end (delta: 20.0MB). Peak memory consumption was 125.5MB. Max. memory is 16.1GB. [2025-03-04 00:59:30,701 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:59:30,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.66ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:59:30,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.45ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 106.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:59:30,702 INFO L158 Benchmark]: Boogie Preprocessor took 42.31ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 102.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:59:30,703 INFO L158 Benchmark]: IcfgBuilder took 318.20ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 82.9MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 00:59:30,703 INFO L158 Benchmark]: TraceAbstraction took 9016.16ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 82.5MB in the beginning and 102.3MB in the end (delta: -19.8MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2025-03-04 00:59:30,703 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 276.8MB. Free memory was 102.3MB in the beginning and 102.2MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:59:30,704 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.66ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.45ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 106.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.31ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 102.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 318.20ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 82.9MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9016.16ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 82.5MB in the beginning and 102.3MB in the end (delta: -19.8MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 276.8MB. Free memory was 102.3MB in the beginning and 102.2MB in the end (delta: 83.0kB). 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 bitwiseOr at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 127.625; [L27] double var_1_10 = 0.8; [L28] double var_1_11 = 128.75; [L29] double var_1_12 = 24.8; [L30] signed short int var_1_14 = -128; [L31] signed char var_1_15 = 64; [L32] signed char var_1_16 = 5; [L33] double var_1_17 = 1.5; [L34] unsigned short int last_1_var_1_1 = 128; VAL [isInitial=0, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L70] var_1_3 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L72] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L72] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L75] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L75] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L76] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L76] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L77] var_1_10 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L78] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L79] var_1_11 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L80] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L81] var_1_16 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L82] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L83] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L83] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L97] RET updateVariables() [L98] CALL step() [L38] var_1_14 = 200 [L39] var_1_15 = var_1_16 [L40] var_1_17 = var_1_10 [L41] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L42] COND TRUE \read(var_1_2) [L43] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L51] signed long int stepLocal_2 = var_1_3 + var_1_1; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L52] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L52] signed long int stepLocal_1 = var_1_14 ^ var_1_15; [L53] COND FALSE !(var_1_15 <= stepLocal_2) [L60] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L62] COND FALSE !(var_1_15 > var_1_15) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10)))) && ((var_1_15 > var_1_15) ? (var_1_12 == ((double) ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) : 1)) && (var_1_14 == ((signed short int) 200))) && (var_1_15 == ((signed char) var_1_16))) && (var_1_17 == ((double) var_1_10)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 1628 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1059 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 818 IncrementalHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 569 mSDtfsCounter, 818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 146 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 885 NumberOfCodeBlocks, 885 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 3447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 1960/1980 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:59:30,730 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-83.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 adf694b6ddef665d6d08615d55edd3b888b46a164390930323ad37ea28078730 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:59:32,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:59:32,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:59:32,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:59:32,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:59:32,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:59:32,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:59:32,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:59:32,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:59:32,602 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:59:32,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:59:32,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:59:32,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:59:32,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:59:32,603 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:59:32,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:59:32,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:59:32,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:59:32,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:59:32,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:59:32,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:59:32,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:59:32,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:59:32,604 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:59:32,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:59:32,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:59:32,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:59:32,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:59:32,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:59:32,606 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:59:32,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:59:32,606 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:59:32,606 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:59:32,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:59:32,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:59:32,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:59:32,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:59:32,607 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 -> adf694b6ddef665d6d08615d55edd3b888b46a164390930323ad37ea28078730 [2025-03-04 00:59:32,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:59:32,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:59:32,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:59:32,840 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:59:32,840 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:59:32,841 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-83.i [2025-03-04 00:59:34,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ef8f28c/1c8931357905426d846e58b619b00222/FLAG4835fe755 [2025-03-04 00:59:34,231 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:59:34,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i [2025-03-04 00:59:34,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ef8f28c/1c8931357905426d846e58b619b00222/FLAG4835fe755 [2025-03-04 00:59:34,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ef8f28c/1c8931357905426d846e58b619b00222 [2025-03-04 00:59:34,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:59:34,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:59:34,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:59:34,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:59:34,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:59:34,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e7e7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34, skipping insertion in model container [2025-03-04 00:59:34,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:59:34,710 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-83.i[913,926] [2025-03-04 00:59:34,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:59:34,745 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:59:34,753 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-83.i[913,926] [2025-03-04 00:59:34,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:59:34,784 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:59:34,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34 WrapperNode [2025-03-04 00:59:34,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:59:34,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:59:34,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:59:34,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:59:34,791 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:59:34" (1/1) ... [2025-03-04 00:59:34,800 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:59:34" (1/1) ... [2025-03-04 00:59:34,818 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-03-04 00:59:34,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:59:34,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:59:34,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:59:34,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:59:34,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,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:59:34" (1/1) ... [2025-03-04 00:59:34,850 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:59:34,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:59:34,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:59:34,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:59:34,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:59:34,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (1/1) ... [2025-03-04 00:59:34,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:59:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:59:34,889 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:59:34,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:59:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:59:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:59:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:59:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:59:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:59:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:59:34,970 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:59:34,971 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:59:35,482 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:59:35,483 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:59:35,490 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:59:35,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:59:35,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:59:35 BoogieIcfgContainer [2025-03-04 00:59:35,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:59:35,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:59:35,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:59:35,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:59:35,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:59:34" (1/3) ... [2025-03-04 00:59:35,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdea901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:59:35, skipping insertion in model container [2025-03-04 00:59:35,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:34" (2/3) ... [2025-03-04 00:59:35,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdea901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:59:35, skipping insertion in model container [2025-03-04 00:59:35,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:59:35" (3/3) ... [2025-03-04 00:59:35,499 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-83.i [2025-03-04 00:59:35,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:59:35,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-83.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:59:35,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:59:35,563 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;@a4f6aea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:59:35,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:59:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 00:59:35,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:35,582 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:35,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:35,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1560909737, now seen corresponding path program 1 times [2025-03-04 00:59:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:59:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896064106] [2025-03-04 00:59:35,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:35,594 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:59:35,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:59:35,597 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:59:35,599 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:59:35,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 00:59:35,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 00:59:35,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:35,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:35,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:59:35,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:59:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 00:59:35,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:59:35,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:59:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896064106] [2025-03-04 00:59:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896064106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:35,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:59:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661093402] [2025-03-04 00:59:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:35,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:59:35,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:59:35,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:59:35,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:59:35,829 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:59:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:35,846 INFO L93 Difference]: Finished difference Result 76 states and 122 transitions. [2025-03-04 00:59:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:59:35,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-03-04 00:59:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:35,853 INFO L225 Difference]: With dead ends: 76 [2025-03-04 00:59:35,853 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 00:59:35,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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:59:35,858 INFO L435 NwaCegarLoop]: 52 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, 52 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:59:35,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:59:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 00:59:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 00:59:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-03-04 00:59:35,883 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 74 [2025-03-04 00:59:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:35,884 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-04 00:59:35,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:59:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2025-03-04 00:59:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 00:59:35,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:35,886 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:35,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:59:36,086 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:59:36,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:36,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:36,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2084196379, now seen corresponding path program 1 times [2025-03-04 00:59:36,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:59:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076382557] [2025-03-04 00:59:36,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:36,088 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:59:36,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:59:36,090 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:59:36,091 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:59:36,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 00:59:36,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 00:59:36,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:36,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:36,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:59:36,247 INFO L279 TraceCheckSpWp]: Computing forward predicates...