./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.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 cd3d3b06025bd7756a6426892295962965c3454eb8c1b0e9922b36e8366261d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:35:28,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:35:28,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:35:28,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:35:28,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:35:28,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:35:28,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:35:28,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:35:28,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:35:28,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:35:28,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:35:28,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:35:28,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:35:28,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:35:28,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:35:28,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:35:28,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:35:28,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:35:28,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:35:28,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:35:28,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:35:28,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:35:28,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:35:28,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:28,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:35:28,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:35:28,171 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 -> cd3d3b06025bd7756a6426892295962965c3454eb8c1b0e9922b36e8366261d1 [2025-03-08 15:35:28,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:35:28,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:35:28,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:35:28,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:35:28,399 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:35:28,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i [2025-03-08 15:35:29,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd4d17d/e9ed5a3789b84adeb107c520b3e4b25f/FLAG8ff8b16cc [2025-03-08 15:35:29,754 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:35:29,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i [2025-03-08 15:35:29,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd4d17d/e9ed5a3789b84adeb107c520b3e4b25f/FLAG8ff8b16cc [2025-03-08 15:35:30,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd4d17d/e9ed5a3789b84adeb107c520b3e4b25f [2025-03-08 15:35:30,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:35:30,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:35:30,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:30,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:35:30,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:35:30,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30, skipping insertion in model container [2025-03-08 15:35:30,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:35:30,226 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_operatoramount_amount25_file-61.i[915,928] [2025-03-08 15:35:30,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:30,264 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:35:30,270 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_operatoramount_amount25_file-61.i[915,928] [2025-03-08 15:35:30,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:30,292 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:35:30,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30 WrapperNode [2025-03-08 15:35:30,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:30,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:30,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:35:30,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:35:30,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,323 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-08 15:35:30,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:30,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:35:30,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:35:30,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:35:30,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,351 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:35:30,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:35:30,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:35:30,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:35:30,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:35:30,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (1/1) ... [2025-03-08 15:35:30,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:30,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:35:30,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:35:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:35:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:35:30,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:35:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:35:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:35:30,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:35:30,458 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:35:30,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:35:30,654 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: havoc property_#t~ite13#1;havoc property_#t~bitwise12#1;havoc property_#t~short14#1; [2025-03-08 15:35:30,678 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 15:35:30,678 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:35:30,690 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:35:30,690 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:35:30,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:30 BoogieIcfgContainer [2025-03-08 15:35:30,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:35:30,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:35:30,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:35:30,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:35:30,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:35:30" (1/3) ... [2025-03-08 15:35:30,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3e1ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:30, skipping insertion in model container [2025-03-08 15:35:30,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:30" (2/3) ... [2025-03-08 15:35:30,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3e1ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:30, skipping insertion in model container [2025-03-08 15:35:30,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:30" (3/3) ... [2025-03-08 15:35:30,700 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-61.i [2025-03-08 15:35:30,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:35:30,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-61.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:35:30,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:35:30,758 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;@1b5eea78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:35:30,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:35:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:35:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 15:35:30,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:30,768 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:30,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:30,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1681362347, now seen corresponding path program 1 times [2025-03-08 15:35:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:35:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327019102] [2025-03-08 15:35:30,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:35:30,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 15:35:30,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 15:35:30,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:30,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 15:35:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:35:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327019102] [2025-03-08 15:35:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327019102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:35:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397224776] [2025-03-08 15:35:30,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:30,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:35:30,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:30,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-08 15:35:30,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:35:31,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 15:35:31,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 15:35:31,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:31,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:31,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:35:31,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 15:35:31,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:35:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397224776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:35:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:35:31,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:35:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718883977] [2025-03-08 15:35:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:35:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:35:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:35:31,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:35:31,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:31,104 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 15:35:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:31,123 INFO L93 Difference]: Finished difference Result 100 states and 159 transitions. [2025-03-08 15:35:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:35:31,125 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-03-08 15:35:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:31,129 INFO L225 Difference]: With dead ends: 100 [2025-03-08 15:35:31,129 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 15:35:31,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:31,133 INFO L435 NwaCegarLoop]: 69 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, 69 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-08 15:35:31,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:35:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 15:35:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 15:35:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:35:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-08 15:35:31,162 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 83 [2025-03-08 15:35:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:31,163 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-08 15:35:31,163 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 15:35:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-08 15:35:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 15:35:31,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:31,166 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:31,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:35:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:35:31,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash -534214413, now seen corresponding path program 1 times [2025-03-08 15:35:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:35:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-03-08 15:35:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:35:31,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 15:35:31,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 15:35:31,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:31,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 15:35:31,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:35:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-03-08 15:35:31,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554730533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:35:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277671531] [2025-03-08 15:35:31,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:35:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:31,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:35:31,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:35:31,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 15:35:31,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 15:35:31,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:31,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:31,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:35:31,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 15:35:31,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:35:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 15:35:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277671531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:35:32,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:35:32,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 15:35:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146685224] [2025-03-08 15:35:32,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:35:32,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:35:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:35:32,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:35:32,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:35:32,047 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:35:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:32,234 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions. [2025-03-08 15:35:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:35:32,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 83 [2025-03-08 15:35:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:32,236 INFO L225 Difference]: With dead ends: 117 [2025-03-08 15:35:32,237 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 15:35:32,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:35:32,238 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 42 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:32,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 178 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:35:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 15:35:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2025-03-08 15:35:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 45 states have internal predecessors, (54), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 15:35:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-03-08 15:35:32,254 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 83 [2025-03-08 15:35:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:32,256 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-03-08 15:35:32,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:35:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2025-03-08 15:35:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 15:35:32,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:32,258 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:32,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:35:32,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 15:35:32,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:32,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1559543291, now seen corresponding path program 1 times [2025-03-08 15:35:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:35:32,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828296663] [2025-03-08 15:35:32,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:35:32,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 15:35:32,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 15:35:32,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:32,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:35:32,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:35:32,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 15:35:32,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 15:35:32,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:32,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:35:32,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:35:32,567 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:35:32,568 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:35:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:35:32,572 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:35:32,633 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:35:32,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:35:32 BoogieIcfgContainer [2025-03-08 15:35:32,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:35:32,637 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:35:32,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:35:32,638 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:35:32,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:30" (3/4) ... [2025-03-08 15:35:32,640 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:35:32,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:35:32,641 INFO L158 Benchmark]: Toolchain (without parser) took 2541.45ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 131.4MB in the end (delta: -9.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:32,641 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:32,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.77ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 110.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:35:32,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.20ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 106.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:35:32,642 INFO L158 Benchmark]: Boogie Preprocessor took 44.46ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:32,643 INFO L158 Benchmark]: IcfgBuilder took 321.78ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 85.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:35:32,643 INFO L158 Benchmark]: TraceAbstraction took 1945.44ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 131.4MB in the end (delta: -46.6MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-03-08 15:35:32,643 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 131.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:32,645 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.35ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.77ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 110.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.20ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 106.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.46ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 321.78ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 85.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1945.44ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 131.4MB in the end (delta: -46.6MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 131.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 35, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 128.6; [L24] float var_1_3 = 49.4; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 8; [L29] unsigned char var_1_8 = 128; [L30] unsigned char var_1_9 = 64; [L31] signed short int var_1_10 = 5; VAL [isInitial=0, var_1_10=5, var_1_1=0, var_1_2=643/5, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L62] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L65] var_1_4 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L66] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L68] var_1_5 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L69] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L72] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L75] RET assume_abort_if_not(var_1_8 >= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L76] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682] [L79] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L79] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L92] RET updateVariables() [L93] CALL step() [L35] COND TRUE var_1_2 < var_1_3 [L36] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L44] COND TRUE \read(var_1_6) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L45] COND TRUE var_1_3 != 15.8f [L46] var_1_7 = (var_1_8 - var_1_9) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L53] EXPR (var_1_9 / 32) << var_1_8 VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L53] signed long int stepLocal_0 = (var_1_9 / 32) << var_1_8; [L54] COND FALSE !(! (var_1_3 < var_1_2)) VAL [isInitial=1, stepLocal_0=0, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L84-L85] return (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 88 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 135 mSDtfsCounter, 142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1253/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:35:32,662 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_operatoramount_amount25_file-61.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 cd3d3b06025bd7756a6426892295962965c3454eb8c1b0e9922b36e8366261d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:35:34,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:35:34,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:35:34,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:35:34,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:35:34,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:35:34,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:35:34,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:35:34,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:35:34,577 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:35:34,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:35:34,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:35:34,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:35:34,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:35:34,579 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:35:34,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:35:34,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:35:34,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:35:34,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:35:34,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:35:34,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:35:34,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:35:34,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:35:34,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:35:34,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:35:34,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:35:34,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:34,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:35:34,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:35:34,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:35:34,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:35:34,581 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:35:34,582 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:35:34,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:35:34,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:35:34,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:35:34,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:35:34,582 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 -> cd3d3b06025bd7756a6426892295962965c3454eb8c1b0e9922b36e8366261d1 [2025-03-08 15:35:34,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:35:34,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:35:34,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:35:34,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:35:34,837 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:35:34,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i [2025-03-08 15:35:35,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678b1bb75/9ed2e24079f5477482ab7d18783a842d/FLAGdf156337d [2025-03-08 15:35:36,183 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:35:36,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i [2025-03-08 15:35:36,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678b1bb75/9ed2e24079f5477482ab7d18783a842d/FLAGdf156337d [2025-03-08 15:35:36,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678b1bb75/9ed2e24079f5477482ab7d18783a842d [2025-03-08 15:35:36,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:35:36,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:35:36,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:36,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:35:36,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:35:36,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a09a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36, skipping insertion in model container [2025-03-08 15:35:36,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:35:36,327 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_operatoramount_amount25_file-61.i[915,928] [2025-03-08 15:35:36,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:36,377 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:35:36,387 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_operatoramount_amount25_file-61.i[915,928] [2025-03-08 15:35:36,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:36,420 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:35:36,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36 WrapperNode [2025-03-08 15:35:36,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:36,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:36,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:35:36,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:35:36,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,454 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-08 15:35:36,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:36,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:35:36,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:35:36,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:35:36,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,475 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:35:36,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:35:36,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:35:36,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:35:36,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:35:36,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (1/1) ... [2025-03-08 15:35:36,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:36,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:36,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:35:36,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:35:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:35:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:35:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:35:36,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:35:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:35:36,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:35:36,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:35:36,604 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:35:36,775 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:35:36,775 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:35:36,782 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:35:36,783 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:35:36,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:36 BoogieIcfgContainer [2025-03-08 15:35:36,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:35:36,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:35:36,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:35:36,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:35:36,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:35:36" (1/3) ... [2025-03-08 15:35:36,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e772f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:36, skipping insertion in model container [2025-03-08 15:35:36,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:36" (2/3) ... [2025-03-08 15:35:36,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e772f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:36, skipping insertion in model container [2025-03-08 15:35:36,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:36" (3/3) ... [2025-03-08 15:35:36,793 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-61.i [2025-03-08 15:35:36,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:35:36,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-61.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:35:36,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:35:36,856 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;@3a746157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:35:36,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:35:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:35:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 15:35:36,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:36,867 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:36,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:36,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash -92332162, now seen corresponding path program 1 times [2025-03-08 15:35:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:35:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700202193] [2025-03-08 15:35:36,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:36,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:36,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:35:36,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:35:36,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 15:35:36,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 15:35:37,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 15:35:37,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:37,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:37,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:35:37,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-08 15:35:37,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:35:37,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:35:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700202193] [2025-03-08 15:35:37,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700202193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:35:37,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:35:37,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:35:37,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779831976] [2025-03-08 15:35:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:35:37,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:35:37,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:35:37,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:35:37,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:37,123 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 15:35:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:37,138 INFO L93 Difference]: Finished difference Result 82 states and 133 transitions. [2025-03-08 15:35:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:35:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-08 15:35:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:37,145 INFO L225 Difference]: With dead ends: 82 [2025-03-08 15:35:37,145 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 15:35:37,148 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-08 15:35:37,149 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:37,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:35:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 15:35:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 15:35:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 15:35:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-03-08 15:35:37,182 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 80 [2025-03-08 15:35:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:37,183 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-03-08 15:35:37,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 15:35:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-03-08 15:35:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 15:35:37,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:37,187 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:37,193 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-08 15:35:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:37,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:37,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2126626208, now seen corresponding path program 1 times [2025-03-08 15:35:37,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:35:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538787826] [2025-03-08 15:35:37,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:35:37,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:35:37,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 15:35:37,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 15:35:37,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 15:35:37,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:37,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:37,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 15:35:37,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 15:35:37,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:35:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 15:35:37,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:35:37,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538787826] [2025-03-08 15:35:37,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538787826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:35:37,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:35:37,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 15:35:37,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684348146] [2025-03-08 15:35:37,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:35:37,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:35:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:35:37,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:35:37,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:35:37,792 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:35:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:37,974 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2025-03-08 15:35:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:35:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 80 [2025-03-08 15:35:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:37,976 INFO L225 Difference]: With dead ends: 99 [2025-03-08 15:35:37,976 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 15:35:37,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:35:37,977 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:37,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 152 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:35:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 15:35:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2025-03-08 15:35:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 15:35:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-03-08 15:35:37,987 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 80 [2025-03-08 15:35:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:37,988 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-03-08 15:35:37,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:35:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-03-08 15:35:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 15:35:37,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:37,989 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:37,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 15:35:38,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:38,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash -131365496, now seen corresponding path program 1 times [2025-03-08 15:35:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:35:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384735788] [2025-03-08 15:35:38,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:38,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:35:38,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:35:38,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 15:35:38,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 15:35:38,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 15:35:38,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:38,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:38,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 15:35:38,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 15:35:38,705 INFO L312 TraceCheckSpWp]: Computing backward predicates...