./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.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 ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:27:49,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:27:49,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:27:49,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:27:49,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:27:49,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:27:49,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:27:49,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:27:49,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:27:49,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:27:49,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:27:49,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:27:49,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:27:49,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:27:49,188 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:27:49,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:27:49,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:27:49,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:27:49,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:27:49,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:27:49,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:27:49,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:27:49,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:27:49,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:27:49,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:27:49,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:27:49,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:27:49,191 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f [2025-03-04 00:27:49,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:27:49,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:27:49,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:27:49,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:27:49,418 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:27:49,418 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-89.i [2025-03-04 00:27:50,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab89f833/546ce5ac6562481793cfa7f5ca79736e/FLAG1838d9a15 [2025-03-04 00:27:50,751 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:27:50,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2025-03-04 00:27:50,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab89f833/546ce5ac6562481793cfa7f5ca79736e/FLAG1838d9a15 [2025-03-04 00:27:51,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab89f833/546ce5ac6562481793cfa7f5ca79736e [2025-03-04 00:27:51,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:27:51,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:27:51,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:27:51,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:27:51,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:27:51,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48531b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51, skipping insertion in model container [2025-03-04 00:27:51,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:27:51,185 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-89.i[915,928] [2025-03-04 00:27:51,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:27:51,220 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:27:51,228 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-89.i[915,928] [2025-03-04 00:27:51,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:27:51,265 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:27:51,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51 WrapperNode [2025-03-04 00:27:51,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:27:51,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:27:51,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:27:51,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:27:51,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,307 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-04 00:27:51,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:27:51,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:27:51,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:27:51,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:27:51,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:27:51,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:27:51,359 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:27:51,359 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:27:51,359 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:27:51,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (1/1) ... [2025-03-04 00:27:51,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:27:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:27:51,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:27:51,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:27:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:27:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:27:51,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:27:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:27:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:27:51,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:27:51,465 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:27:51,467 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:27:51,670 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:27:51,671 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:27:51,680 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:27:51,680 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:27:51,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:51 BoogieIcfgContainer [2025-03-04 00:27:51,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:27:51,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:27:51,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:27:51,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:27:51,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:27:51" (1/3) ... [2025-03-04 00:27:51,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f59e669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:27:51, skipping insertion in model container [2025-03-04 00:27:51,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:51" (2/3) ... [2025-03-04 00:27:51,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f59e669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:27:51, skipping insertion in model container [2025-03-04 00:27:51,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:51" (3/3) ... [2025-03-04 00:27:51,690 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-89.i [2025-03-04 00:27:51,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:27:51,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-89.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:27:51,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:27:51,757 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;@5c4d4a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:27:51,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:27:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:27:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:27:51,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:51,772 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:27:51,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:51,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1365838779, now seen corresponding path program 1 times [2025-03-04 00:27:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048944824] [2025-03-04 00:27:51,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:51,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:27:51,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:27:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:51,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:27:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:51,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048944824] [2025-03-04 00:27:51,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048944824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:27:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051213494] [2025-03-04 00:27:51,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:51,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:27:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:27:51,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:27:51,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:27:52,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:27:52,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:27:52,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:52,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:52,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:27:52,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:27:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:27:52,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:27:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051213494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:52,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:27:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:27:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666733713] [2025-03-04 00:27:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:52,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:27:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:27:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:27:52,166 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:27:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:52,180 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-03-04 00:27:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:27:52,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2025-03-04 00:27:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:52,185 INFO L225 Difference]: With dead ends: 100 [2025-03-04 00:27:52,185 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 00:27:52,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:27:52,189 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:52,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:27:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 00:27:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 00:27:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:27:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-04 00:27:52,218 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 120 [2025-03-04 00:27:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:52,218 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-04 00:27:52,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:27:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-04 00:27:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:27:52,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:52,222 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:27:52,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:27:52,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:27:52,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:52,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2006363592, now seen corresponding path program 1 times [2025-03-04 00:27:52,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:52,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662413117] [2025-03-04 00:27:52,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:52,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:27:52,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:27:52,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:52,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:27:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571142629] [2025-03-04 00:27:52,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:52,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:27:52,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:27:52,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:27:52,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:27:52,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:27:52,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:27:52,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:52,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:27:52,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:27:52,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:27:52,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:27:52,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:27:52,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:27:52,759 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:27:52,760 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:27:52,769 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-04 00:27:52,962 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-04 00:27:52,965 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:27:53,015 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:27:53,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:27:53 BoogieIcfgContainer [2025-03-04 00:27:53,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:27:53,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:27:53,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:27:53,018 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:27:53,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:51" (3/4) ... [2025-03-04 00:27:53,021 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:27:53,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:27:53,023 INFO L158 Benchmark]: Toolchain (without parser) took 1946.70ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 66.1MB in the end (delta: 38.2MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2025-03-04 00:27:53,023 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:27:53,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.62ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 90.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:27:53,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.83ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:27:53,026 INFO L158 Benchmark]: Boogie Preprocessor took 45.82ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 85.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:27:53,026 INFO L158 Benchmark]: IcfgBuilder took 322.35ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 67.5MB in the end (delta: 18.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 00:27:53,027 INFO L158 Benchmark]: TraceAbstraction took 1333.69ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 66.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:27:53,028 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 66.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:27:53,029 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.62ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 90.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.83ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.82ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 85.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 322.35ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 67.5MB in the end (delta: 18.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1333.69ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 66.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 66.1MB 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 someBinaryArithmeticDOUBLEoperation at line 52, overapproximation of someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 5; [L24] unsigned char var_1_3 = 4; [L25] signed long int var_1_4 = -256; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] double var_1_9 = 9.5; [L31] double var_1_10 = -0.4; [L32] double var_1_11 = 31.5; [L33] double var_1_12 = 16.25; [L34] double var_1_13 = 127.5; [L35] double var_1_14 = 100000.5; VAL [isInitial=0, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_2=5, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L59] var_1_3 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L63] var_1_4 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L64] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L67] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L70] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L78] var_1_10 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L79] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L80] var_1_12 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L81] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L98] RET updateVariables() [L99] CALL step() [L39] COND TRUE (var_1_2 / var_1_3) >= var_1_4 [L40] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, var_1_11=63/2, var_1_1=1, var_1_2=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L44] unsigned char stepLocal_0 = (var_1_6 && var_1_8) || (var_1_2 >= 5); VAL [isInitial=1, stepLocal_0=0, var_1_11=63/2, var_1_1=1, var_1_2=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L45] COND FALSE !(stepLocal_0 && (var_1_3 < var_1_4)) [L48] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L50] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L51] COND TRUE (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || stepLocal_1 [L52] var_1_11 = (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 / var_1_3) >= var_1_4) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : (var_1_1 == ((unsigned char) ((var_1_3 >= var_1_2) && (var_1_7 || var_1_8))))) && ((((var_1_6 && var_1_8) || (var_1_2 >= 5)) && (var_1_3 < var_1_4)) ? (var_1_9 == ((double) var_1_10)) : (var_1_9 == ((double) var_1_10)))) && (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || var_1_6) ? (var_1_11 == ((double) (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2, var_1_1=1, var_1_2=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=0, var_1_3=1, var_1_4=-2147483648, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 71 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 238 SizeOfPredicates, 0 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:27:53,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-89.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 ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:27:54,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:27:54,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:27:54,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:27:54,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:27:54,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:27:54,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:27:54,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:27:54,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:27:54,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:27:54,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:27:54,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:27:54,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:27:54,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:27:54,957 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:27:54,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:27:54,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:27:54,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:27:54,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:27:54,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:27:54,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:27:54,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:27:54,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:27:54,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:27:54,959 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:27:54,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:27:54,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:27:54,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:27:54,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:27:54,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:27:54,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:27:54,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:27:54,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:27:54,960 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 -> ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f [2025-03-04 00:27:55,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:27:55,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:27:55,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:27:55,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:27:55,216 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:27:55,217 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-89.i [2025-03-04 00:27:56,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03b843cb/9f08076310b143169290d8d80ed8202c/FLAG849fd5420 [2025-03-04 00:27:56,647 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:27:56,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2025-03-04 00:27:56,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03b843cb/9f08076310b143169290d8d80ed8202c/FLAG849fd5420 [2025-03-04 00:27:56,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03b843cb/9f08076310b143169290d8d80ed8202c [2025-03-04 00:27:56,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:27:56,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:27:56,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:27:56,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:27:56,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:27:56,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2ce0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56, skipping insertion in model container [2025-03-04 00:27:56,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:27:56,796 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-89.i[915,928] [2025-03-04 00:27:56,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:27:56,851 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:27:56,862 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-89.i[915,928] [2025-03-04 00:27:56,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:27:56,891 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:27:56,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56 WrapperNode [2025-03-04 00:27:56,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:27:56,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:27:56,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:27:56,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:27:56,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,918 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-04 00:27:56,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:27:56,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:27:56,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:27:56,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:27:56,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,936 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:27:56,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:27:56,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:27:56,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:27:56,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:27:56,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (1/1) ... [2025-03-04 00:27:56,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:27:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:27:56,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:27:56,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:27:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:27:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:27:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:27:56,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:27:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:27:56,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:27:57,042 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:27:57,043 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:27:57,431 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:27:57,431 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:27:57,439 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:27:57,441 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:27:57,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:57 BoogieIcfgContainer [2025-03-04 00:27:57,441 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:27:57,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:27:57,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:27:57,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:27:57,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:27:56" (1/3) ... [2025-03-04 00:27:57,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b41643f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:27:57, skipping insertion in model container [2025-03-04 00:27:57,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:56" (2/3) ... [2025-03-04 00:27:57,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b41643f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:27:57, skipping insertion in model container [2025-03-04 00:27:57,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:57" (3/3) ... [2025-03-04 00:27:57,451 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-89.i [2025-03-04 00:27:57,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:27:57,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-89.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:27:57,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:27:57,517 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;@288bce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:27:57,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:27:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:27:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:27:57,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:57,540 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:27:57,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:57,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1365838779, now seen corresponding path program 1 times [2025-03-04 00:27:57,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:27:57,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680542883] [2025-03-04 00:27:57,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:57,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:27:57,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:27:57,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:27:57,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:27:57,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:27:57,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:27:57,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:57,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:57,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:27:57,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:27:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-04 00:27:57,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:27:57,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:27:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680542883] [2025-03-04 00:27:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680542883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:27:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:27:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553154290] [2025-03-04 00:27:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:57,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:27:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:27:57,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:27:57,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:27:57,813 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:27:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:57,833 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-03-04 00:27:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:27:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2025-03-04 00:27:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:57,841 INFO L225 Difference]: With dead ends: 100 [2025-03-04 00:27:57,841 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 00:27:57,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:27:57,847 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:57,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:27:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 00:27:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 00:27:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:27:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-04 00:27:57,884 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 120 [2025-03-04 00:27:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:57,885 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-04 00:27:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:27:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-04 00:27:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:27:57,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:57,891 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:27:57,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:27:58,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:27:58,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:58,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2006363592, now seen corresponding path program 1 times [2025-03-04 00:27:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:27:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916926817] [2025-03-04 00:27:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:27:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:27:58,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:27:58,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:27:58,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:27:58,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:27:58,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:58,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:58,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 00:27:58,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:28:48,647 WARN L286 SmtUtils]: Spent 20.43s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)