./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.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_amount10_file-87.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 e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:06:39,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:06:39,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:06:39,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:06:39,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:06:39,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:06:39,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:06:39,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:06:39,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:06:39,747 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:06:39,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:06:39,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:06:39,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:06:39,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:06:39,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:06:39,749 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:39,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:06:39,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:06:39,749 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 -> e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 [2025-03-04 00:06:40,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:06:40,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:06:40,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:06:40,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:06:40,170 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:06:40,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2025-03-04 00:06:41,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e184cc/f2e76945567040f085ca173ceb3284dc/FLAGd74dbceb3 [2025-03-04 00:06:42,210 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:06:42,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2025-03-04 00:06:42,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e184cc/f2e76945567040f085ca173ceb3284dc/FLAGd74dbceb3 [2025-03-04 00:06:42,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e184cc/f2e76945567040f085ca173ceb3284dc [2025-03-04 00:06:42,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:06:42,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:06:42,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:42,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:06:42,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:06:42,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c8227a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42, skipping insertion in model container [2025-03-04 00:06:42,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:06:42,643 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_amount10_file-87.i[915,928] [2025-03-04 00:06:42,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:42,710 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:06:42,726 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_amount10_file-87.i[915,928] [2025-03-04 00:06:42,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:42,780 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:06:42,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42 WrapperNode [2025-03-04 00:06:42,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:42,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:42,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:06:42,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:06:42,790 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:06:42" (1/1) ... [2025-03-04 00:06:42,803 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:06:42" (1/1) ... [2025-03-04 00:06:42,833 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2025-03-04 00:06:42,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:42,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:06:42,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:06:42,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:06:42,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,865 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:06:42,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:06:42,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:06:42,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:06:42,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:06:42,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (1/1) ... [2025-03-04 00:06:42,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:42,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:06:42,962 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:06:42,968 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:06:42,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:06:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:06:42,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:06:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:06:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:06:42,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:06:43,066 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:06:43,068 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:06:43,333 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:06:43,338 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:06:43,351 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:06:43,353 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:06:43,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:43 BoogieIcfgContainer [2025-03-04 00:06:43,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:06:43,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:06:43,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:06:43,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:06:43,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:06:42" (1/3) ... [2025-03-04 00:06:43,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe5ed51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:43, skipping insertion in model container [2025-03-04 00:06:43,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:42" (2/3) ... [2025-03-04 00:06:43,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe5ed51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:43, skipping insertion in model container [2025-03-04 00:06:43,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:43" (3/3) ... [2025-03-04 00:06:43,370 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-87.i [2025-03-04 00:06:43,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:06:43,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-87.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:06:43,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:06:43,515 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;@85ee7de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:06:43,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:06:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 00:06:43,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:43,541 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:43,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:43,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash -64130486, now seen corresponding path program 1 times [2025-03-04 00:06:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:06:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464236020] [2025-03-04 00:06:43,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:06:43,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 00:06:43,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 00:06:43,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:43,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 00:06:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:06:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464236020] [2025-03-04 00:06:43,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464236020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015973828] [2025-03-04 00:06:43,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:43,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:06:43,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:06:43,817 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:06:43,819 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:06:43,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 00:06:43,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 00:06:43,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:43,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:43,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:06:43,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 00:06:43,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:06:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015973828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:43,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:06:43,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:06:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769751337] [2025-03-04 00:06:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:43,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:06:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:06:43,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:06:43,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:06:43,977 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:06:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:44,005 INFO L93 Difference]: Finished difference Result 68 states and 108 transitions. [2025-03-04 00:06:44,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:06:44,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2025-03-04 00:06:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:44,015 INFO L225 Difference]: With dead ends: 68 [2025-03-04 00:06:44,015 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 00:06:44,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:06:44,024 INFO L435 NwaCegarLoop]: 46 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, 46 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:06:44,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:06:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 00:06:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 00:06:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-04 00:06:44,079 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 71 [2025-03-04 00:06:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:44,079 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-04 00:06:44,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:06:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-03-04 00:06:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 00:06:44,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:44,081 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:44,097 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:06:44,282 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:06:44,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:44,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1507486187, now seen corresponding path program 1 times [2025-03-04 00:06:44,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:06:44,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109768032] [2025-03-04 00:06:44,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:44,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:06:44,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 00:06:44,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 00:06:44,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:44,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:06:44,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:06:44,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 00:06:44,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 00:06:44,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:44,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:06:44,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:06:44,562 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:06:44,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:06:44,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:06:44,570 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:06:44,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:06:44,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:06:44 BoogieIcfgContainer [2025-03-04 00:06:44,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:06:44,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:06:44,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:06:44,676 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:06:44,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:43" (3/4) ... [2025-03-04 00:06:44,683 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:06:44,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:06:44,684 INFO L158 Benchmark]: Toolchain (without parser) took 2253.05ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 108.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,685 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:44,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.84ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 100.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.79ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:44,685 INFO L158 Benchmark]: Boogie Preprocessor took 46.03ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,687 INFO L158 Benchmark]: IcfgBuilder took 470.46ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 84.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,687 INFO L158 Benchmark]: TraceAbstraction took 1315.38ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 108.4MB in the end (delta: -24.8MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,687 INFO L158 Benchmark]: Witness Printer took 7.93ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 108.4MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:44,694 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.84ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 100.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.79ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.03ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 470.46ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 84.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1315.38ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 108.4MB in the end (delta: -24.8MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Witness Printer took 7.93ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 108.4MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned short int var_1_3 = 64; [L24] signed long int var_1_4 = 5; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 0; [L29] float var_1_9 = 256.75; [L30] float var_1_10 = 99.2; VAL [isInitial=0, var_1_10=496/5, var_1_1=1, var_1_3=64, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L46] var_1_3 = __VERIFIER_nondet_ushort() [L47] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L47] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L48] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L48] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L49] var_1_4 = __VERIFIER_nondet_long() [L50] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L50] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L51] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L51] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L52] var_1_5 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L53] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L54] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L54] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L55] var_1_6 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L56] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L57] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L57] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L58] var_1_7 = __VERIFIER_nondet_uchar() [L59] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L59] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L60] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L60] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] 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_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L62] 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_1=1, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L75] RET updateVariables() [L76] CALL step() [L34] var_1_8 = var_1_3 [L35] var_1_9 = var_1_10 [L36] signed long int stepLocal_0 = 10 - var_1_4; VAL [isInitial=1, stepLocal_0=9, var_1_10=261, var_1_1=1, var_1_3=5, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=5, var_1_9=261] [L37] COND TRUE (var_1_8 + var_1_8) > stepLocal_0 [L38] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=261, var_1_1=-255, var_1_3=5, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=5, var_1_9=261] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return ((((var_1_8 + var_1_8) > (10 - var_1_4)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_5 ? (var_1_1 == ((unsigned char) (var_1_6 || var_1_7))) : 1)) && (var_1_8 == ((unsigned long int) var_1_3))) && (var_1_9 == ((float) var_1_10)) ; VAL [\result=0, isInitial=1, var_1_10=261, var_1_1=-255, var_1_3=5, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=5, var_1_9=261] [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=261, var_1_1=-255, var_1_3=5, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=5, var_1_9=261] [L19] reach_error() VAL [isInitial=1, var_1_10=261, var_1_1=-255, var_1_3=5, var_1_4=1, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=5, var_1_9=261] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 46 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, 46 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 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:06:44,720 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_amount10_file-87.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 e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:06:47,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:06:48,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:06:48,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:06:48,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:06:48,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:06:48,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:06:48,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:06:48,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:06:48,084 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:06:48,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:06:48,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:06:48,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:06:48,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:06:48,084 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:06:48,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:06:48,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:06:48,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:48,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:06:48,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:06:48,086 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 -> e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 [2025-03-04 00:06:48,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:06:48,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:06:48,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:06:48,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:06:48,518 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:06:48,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2025-03-04 00:06:50,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/074c0f62d/477e63777f504c46a8a7c2abcf10132f/FLAG06b8eff34 [2025-03-04 00:06:50,636 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:06:50,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2025-03-04 00:06:50,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/074c0f62d/477e63777f504c46a8a7c2abcf10132f/FLAG06b8eff34 [2025-03-04 00:06:50,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/074c0f62d/477e63777f504c46a8a7c2abcf10132f [2025-03-04 00:06:50,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:06:50,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:06:50,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:50,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:06:50,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:06:50,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:50" (1/1) ... [2025-03-04 00:06:50,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277938c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:50, skipping insertion in model container [2025-03-04 00:06:50,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:50" (1/1) ... [2025-03-04 00:06:50,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:06:51,063 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_amount10_file-87.i[915,928] [2025-03-04 00:06:51,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:51,121 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:06:51,134 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_amount10_file-87.i[915,928] [2025-03-04 00:06:51,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:51,184 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:06:51,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51 WrapperNode [2025-03-04 00:06:51,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:51,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:51,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:06:51,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:06:51,196 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:06:51" (1/1) ... [2025-03-04 00:06:51,209 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:06:51" (1/1) ... [2025-03-04 00:06:51,244 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2025-03-04 00:06:51,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:51,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:06:51,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:06:51,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:06:51,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,286 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:06:51,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:06:51,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:06:51,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:06:51,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:06:51,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (1/1) ... [2025-03-04 00:06:51,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:06:51,392 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:06:51,398 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:06:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:06:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:06:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:06:51,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:06:51,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:06:51,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:06:51,529 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:06:51,534 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:06:51,801 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:06:51,807 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:06:51,815 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:06:51,815 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:06:51,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:51 BoogieIcfgContainer [2025-03-04 00:06:51,816 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:06:51,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:06:51,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:06:51,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:06:51,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:06:50" (1/3) ... [2025-03-04 00:06:51,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eed2d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:51, skipping insertion in model container [2025-03-04 00:06:51,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:51" (2/3) ... [2025-03-04 00:06:51,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eed2d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:51, skipping insertion in model container [2025-03-04 00:06:51,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:51" (3/3) ... [2025-03-04 00:06:51,838 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-87.i [2025-03-04 00:06:51,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:06:51,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-87.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:06:51,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:06:51,924 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;@2cf76f33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:06:51,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:06:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 00:06:51,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:51,939 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:51,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:51,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -64130486, now seen corresponding path program 1 times [2025-03-04 00:06:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:51,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396960590] [2025-03-04 00:06:51,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:51,960 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:06:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:51,962 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:06:51,964 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:06:52,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 00:06:52,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 00:06:52,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:52,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:52,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:06:52,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-04 00:06:52,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:06:52,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:52,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396960590] [2025-03-04 00:06:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396960590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:52,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:06:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:06:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679635998] [2025-03-04 00:06:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:52,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:06:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:06:52,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:06:52,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:06:52,293 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:06:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:52,327 INFO L93 Difference]: Finished difference Result 68 states and 108 transitions. [2025-03-04 00:06:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:06:52,330 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2025-03-04 00:06:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:52,338 INFO L225 Difference]: With dead ends: 68 [2025-03-04 00:06:52,342 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 00:06:52,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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:06:52,351 INFO L435 NwaCegarLoop]: 46 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, 46 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:06:52,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:06:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 00:06:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 00:06:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-04 00:06:52,402 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 71 [2025-03-04 00:06:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:52,403 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-04 00:06:52,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:06:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-03-04 00:06:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 00:06:52,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:52,407 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:52,417 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:06:52,614 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:06:52,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:52,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1507486187, now seen corresponding path program 1 times [2025-03-04 00:06:52,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:52,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477079951] [2025-03-04 00:06:52,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:52,617 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:06:52,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:52,619 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:06:52,621 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:06:52,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 00:06:52,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 00:06:52,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:52,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:52,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:06:52,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-04 00:06:56,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:06:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 00:06:58,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:58,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477079951] [2025-03-04 00:06:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477079951] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:58,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:06:58,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2025-03-04 00:06:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357179730] [2025-03-04 00:06:58,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:58,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:06:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:06:58,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:06:58,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:06:58,591 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:06:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:59,370 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-04 00:06:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:06:59,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2025-03-04 00:06:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:59,372 INFO L225 Difference]: With dead ends: 50 [2025-03-04 00:06:59,372 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 00:06:59,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:06:59,373 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 83 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:59,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 133 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:06:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 00:06:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2025-03-04 00:06:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-03-04 00:06:59,389 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 71 [2025-03-04 00:06:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:59,390 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-03-04 00:06:59,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:06:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2025-03-04 00:06:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:06:59,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:59,393 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:59,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:06:59,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:59,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:59,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash -424772423, now seen corresponding path program 1 times [2025-03-04 00:06:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:59,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844783868] [2025-03-04 00:06:59,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:59,601 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:06:59,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:59,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:59,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:06:59,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:06:59,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:06:59,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:59,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:59,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:06:59,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-04 00:07:02,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 00:07:05,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:07:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844783868] [2025-03-04 00:07:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844783868] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 22 [2025-03-04 00:07:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550725105] [2025-03-04 00:07:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:05,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:07:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:07:05,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:07:05,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-03-04 00:07:05,102 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:07:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:06,000 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-03-04 00:07:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:07:06,000 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2025-03-04 00:07:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:06,001 INFO L225 Difference]: With dead ends: 56 [2025-03-04 00:07:06,001 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 00:07:06,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:07:06,002 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 76 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:06,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 136 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:07:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 00:07:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-03-04 00:07:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:07:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2025-03-04 00:07:06,018 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 72 [2025-03-04 00:07:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:06,018 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-03-04 00:07:06,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:07:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2025-03-04 00:07:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:07:06,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:06,021 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:06,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:07:06,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:06,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:06,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash -423848902, now seen corresponding path program 1 times [2025-03-04 00:07:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:07:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045176841] [2025-03-04 00:07:06,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:06,225 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:07:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:07:06,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:07:06,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 00:07:06,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:07:06,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:07:06,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:06,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:06,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 00:07:06,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 00:07:06,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 00:07:06,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:07:06,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045176841] [2025-03-04 00:07:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045176841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:06,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:07:06,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-04 00:07:06,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638707634] [2025-03-04 00:07:06,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:06,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:07:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:07:06,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:07:06,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:07:06,484 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:07:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:06,655 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2025-03-04 00:07:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:07:06,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 72 [2025-03-04 00:07:06,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:06,656 INFO L225 Difference]: With dead ends: 88 [2025-03-04 00:07:06,656 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:07:06,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:07:06,657 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:06,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 57 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:07:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:07:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:07:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:07:06,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2025-03-04 00:07:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:06,666 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:07:06,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:07:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:07:06,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:07:06,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:07:06,696 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 (5)] Ended with exit code 0 [2025-03-04 00:07:06,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:07:06,875 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:07:06,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:07:07,521 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:07:07,530 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2025-03-04 00:07:07,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:07:07 BoogieIcfgContainer [2025-03-04 00:07:07,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:07:07,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:07:07,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:07:07,534 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:07:07,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:51" (3/4) ... [2025-03-04 00:07:07,536 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:07:07,540 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:07:07,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:07:07,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:07:07,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:07:07,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:07:07,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:07:07,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:07:07,688 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:07:07,689 INFO L158 Benchmark]: Toolchain (without parser) took 16827.95ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 59.7MB in the beginning and 435.1MB in the end (delta: -375.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-03-04 00:07:07,691 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:07,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.94ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 47.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:07,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.38ms. Allocated memory is still 83.9MB. Free memory was 47.6MB in the beginning and 46.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:07,692 INFO L158 Benchmark]: Boogie Preprocessor took 74.60ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 44.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:07,693 INFO L158 Benchmark]: IcfgBuilder took 497.23ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 31.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:07,693 INFO L158 Benchmark]: TraceAbstraction took 15713.99ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 31.1MB in the beginning and 439.2MB in the end (delta: -408.1MB). Peak memory consumption was 257.2MB. Max. memory is 16.1GB. [2025-03-04 00:07:07,693 INFO L158 Benchmark]: Witness Printer took 154.91ms. Allocated memory is still 486.5MB. Free memory was 439.2MB in the beginning and 435.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:07,700 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.36ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.94ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 47.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.38ms. Allocated memory is still 83.9MB. Free memory was 47.6MB in the beginning and 46.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.60ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 44.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 497.23ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 31.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15713.99ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 31.1MB in the beginning and 439.2MB in the end (delta: -408.1MB). Peak memory consumption was 257.2MB. Max. memory is 16.1GB. * Witness Printer took 154.91ms. Allocated memory is still 486.5MB. Free memory was 439.2MB in the beginning and 435.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 4, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 148 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 494 ConstructedInterpolants, 9 QuantifiedInterpolants, 2070 SizeOfPredicates, 30 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1462/1540 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 73]: Location Invariant Derived location invariant: (var_1_5 >= 1) RESULT: Ultimate proved your program to be correct! [2025-03-04 00:07:07,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE