./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8a6163d47f45212f7977b0ec00cda47715422109bdfe89125f498dea9ca08aac --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:35:32,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:35:32,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:35:32,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:35:32,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:35:32,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:35:32,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:35:32,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:35:32,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:35:32,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:35:32,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:35:32,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:35:32,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:35:32,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:35:32,437 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:35:32,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:35:32,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:35:32,437 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:35:32,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:35:32,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:35:32,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:35:32,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:35:32,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:32,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:35:32,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:35:32,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:35:32,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:35:32,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:32,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:35:32,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:35:32,440 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:35:32,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:35:32,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:35:32,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:35:32,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:35:32,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:35:32,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:35:32,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:35:32,440 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-jdk21/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 -> 8a6163d47f45212f7977b0ec00cda47715422109bdfe89125f498dea9ca08aac [2025-01-09 14:35:32,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:35:32,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:35:32,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:35:32,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:35:32,661 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:35:32,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i [2025-01-09 14:35:33,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3719f096d/09c950b09bde40d786ab46922e4d1393/FLAGf6059108d [2025-01-09 14:35:34,120 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:35:34,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i [2025-01-09 14:35:34,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3719f096d/09c950b09bde40d786ab46922e4d1393/FLAGf6059108d [2025-01-09 14:35:34,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3719f096d/09c950b09bde40d786ab46922e4d1393 [2025-01-09 14:35:34,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:35:34,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:35:34,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:35:34,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:35:34,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:35:34,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34, skipping insertion in model container [2025-01-09 14:35:34,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:35:34,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i[915,928] [2025-01-09 14:35:34,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:35:34,556 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:35:34,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i[915,928] [2025-01-09 14:35:34,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:35:34,592 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:35:34,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34 WrapperNode [2025-01-09 14:35:34,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:35:34,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:35:34,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:35:34,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:35:34,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,625 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-01-09 14:35:34,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:35:34,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:35:34,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:35:34,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:35:34,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,644 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-01-09 14:35:34,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:35:34,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:35:34,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:35:34,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:35:34,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (1/1) ... [2025-01-09 14:35:34,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:34,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:35:34,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:35:34,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:35:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:35:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:35:34,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:35:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:35:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:35:34,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:35:34,743 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:35:34,744 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:35:34,862 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:35:34,862 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:35:34,868 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:35:34,868 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:35:34,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:34 BoogieIcfgContainer [2025-01-09 14:35:34,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:35:34,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:35:34,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:35:34,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:35:34,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:35:34" (1/3) ... [2025-01-09 14:35:34,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a1b76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:35:34, skipping insertion in model container [2025-01-09 14:35:34,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:34" (2/3) ... [2025-01-09 14:35:34,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a1b76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:35:34, skipping insertion in model container [2025-01-09 14:35:34,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:34" (3/3) ... [2025-01-09 14:35:34,874 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-43.i [2025-01-09 14:35:34,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:35:34,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-43.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:35:34,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:35:34,925 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;@73d0c07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:35:34,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:35:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:35:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 14:35:34,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:34,936 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:35:34,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:34,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1242397310, now seen corresponding path program 1 times [2025-01-09 14:35:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:35:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-01-09 14:35:34,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:35:35,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:35:35,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:35:35,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:35,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:35:35,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:35:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-01-09 14:35:35,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930090440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:35:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908168188] [2025-01-09 14:35:35,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:35,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:35:35,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:35:35,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:35:35,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:35:35,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:35:35,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:35:35,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:35,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:35,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:35:35,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:35:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:35:35,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:35:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908168188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:35:35,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:35:35,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:35:35,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842533449] [2025-01-09 14:35:35,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:35:35,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:35:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:35:35,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:35:35,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:35:35,305 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:35:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:35:35,330 INFO L93 Difference]: Finished difference Result 84 states and 133 transitions. [2025-01-09 14:35:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:35:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-01-09 14:35:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:35:35,335 INFO L225 Difference]: With dead ends: 84 [2025-01-09 14:35:35,335 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 14:35:35,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-01-09 14:35:35,339 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:35:35,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:35:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 14:35:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 14:35:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:35:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-01-09 14:35:35,366 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2025-01-09 14:35:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:35:35,366 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-01-09 14:35:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:35:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-01-09 14:35:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 14:35:35,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:35,372 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:35:35,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:35:35,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:35:35,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:35,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash 516108990, now seen corresponding path program 1 times [2025-01-09 14:35:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:35:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250536908] [2025-01-09 14:35:35,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:35:35,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:35:35,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:35:35,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:35,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 14:35:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:35:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250536908] [2025-01-09 14:35:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250536908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:35:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618661072] [2025-01-09 14:35:35,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:35,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:35:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:35:35,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:35:35,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:35:36,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:35:36,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:35:36,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:36,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:36,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:35:36,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:35:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 14:35:36,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:35:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 14:35:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618661072] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:35:36,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:35:36,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 14:35:36,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38576837] [2025-01-09 14:35:36,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:35:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:35:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:35:36,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:35:36,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:35:36,331 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:35:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:35:36,486 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-01-09 14:35:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:35:36,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 82 [2025-01-09 14:35:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:35:36,488 INFO L225 Difference]: With dead ends: 89 [2025-01-09 14:35:36,488 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 14:35:36,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:35:36,489 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 110 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:35:36,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 90 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:35:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 14:35:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-01-09 14:35:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:35:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-01-09 14:35:36,496 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 82 [2025-01-09 14:35:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:35:36,496 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-01-09 14:35:36,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:35:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2025-01-09 14:35:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 14:35:36,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:36,498 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:35:36,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:35:36,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:35:36,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:36,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash 517956032, now seen corresponding path program 1 times [2025-01-09 14:35:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:35:36,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-01-09 14:35:36,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:35:36,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:35:36,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:35:36,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:36,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:35:36,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:35:36,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:35:36,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:35:36,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:36,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:35:36,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:35:36,774 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:35:36,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:35:36,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:35:36,780 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:35:36,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:35:36,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:35:36 BoogieIcfgContainer [2025-01-09 14:35:36,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:35:36,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:35:36,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:35:36,838 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:35:36,838 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:34" (3/4) ... [2025-01-09 14:35:36,840 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:35:36,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:35:36,841 INFO L158 Benchmark]: Toolchain (without parser) took 2433.76ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 78.8MB in the end (delta: 33.0MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2025-01-09 14:35:36,842 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:35:36,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.08ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 99.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:35:36,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.67ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:35:36,844 INFO L158 Benchmark]: Boogie Preprocessor took 25.93ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:35:36,845 INFO L158 Benchmark]: RCFGBuilder took 213.10ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 81.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:35:36,845 INFO L158 Benchmark]: TraceAbstraction took 1967.10ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 79.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2025-01-09 14:35:36,845 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 78.8MB in the end (delta: 910.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:35:36,846 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.19ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.08ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 99.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.67ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.93ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 213.10ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 81.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1967.10ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 79.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 78.8MB in the end (delta: 910.5kB). 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 64, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryArithmeticFLOAToperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] float var_1_4 = 64.4; [L24] float var_1_5 = 0.2; [L25] double var_1_8 = 31.75; [L26] double var_1_9 = 50.375; [L27] double var_1_10 = 99.25; [L28] double var_1_11 = 16.4; [L29] double var_1_12 = 64.5; [L30] float var_1_13 = 8.75; [L31] float var_1_14 = 127.1; [L32] unsigned short int var_1_15 = 5; [L33] unsigned char var_1_18 = 0; [L34] unsigned char var_1_19 = 0; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 8; [L37] double last_1_var_1_8 = 31.75; VAL [isInitial=0, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_4=322/5, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L93] isInitial = 1 [L94] FCALL initially() [L96] CALL updateLastVariables() [L86] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_4=322/5, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L63] var_1_4 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L64] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L65] var_1_5 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L66] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L68] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L69] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L69] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L70] var_1_10 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L71] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L72] var_1_11 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L74] var_1_12 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L76] var_1_14 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L77] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L78] var_1_19 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L79] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L80] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L80] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L81] var_1_21 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L82] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L83] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L83] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L97] RET updateVariables() [L98] CALL step() [L41] COND FALSE !((- (var_1_5 / var_1_9)) != last_1_var_1_8) [L46] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=259] [L48] var_1_13 = (128.75f + var_1_14) [L49] var_1_18 = var_1_19 [L50] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=254, var_1_21=254, var_1_8=259] [L51] COND FALSE !(var_1_13 != ((((var_1_13) > ((var_1_4 - var_1_5))) ? (var_1_13) : ((var_1_4 - var_1_5))))) [L56] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L58] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return ((((((var_1_13 != ((((var_1_13) > ((var_1_4 - var_1_5))) ? (var_1_13) : ((var_1_4 - var_1_5))))) ? (var_1_18 ? (var_1_1 == ((signed short int) var_1_20)) : 1) : (var_1_1 == ((signed short int) var_1_20))) && (((- (var_1_5 / var_1_9)) != last_1_var_1_8) ? ((var_1_4 != (- var_1_9)) ? (var_1_8 == ((double) ((var_1_10 + var_1_11) - var_1_12))) : 1) : (var_1_8 == ((double) var_1_12)))) && (var_1_13 == ((float) (128.75f + var_1_14)))) && (var_1_18 ? (var_1_15 == ((unsigned short int) (var_1_20 + var_1_20))) : 1)) && (var_1_18 == ((unsigned char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 97 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 579 SizeOfPredicates, 2 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1280/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:35:36,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8a6163d47f45212f7977b0ec00cda47715422109bdfe89125f498dea9ca08aac --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:35:38,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:35:38,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:35:38,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:35:38,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:35:38,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:35:38,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:35:38,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:35:38,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:35:38,838 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:35:38,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:35:38,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:35:38,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:35:38,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:35:38,839 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:35:38,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:35:38,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:35:38,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:35:38,841 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:35:38,841 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:35:38,841 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:35:38,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:35:38,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:35:38,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:35:38,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:38,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:35:38,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:35:38,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:35:38,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:35:38,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:38,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:35:38,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:35:38,844 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-jdk21/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 -> 8a6163d47f45212f7977b0ec00cda47715422109bdfe89125f498dea9ca08aac [2025-01-09 14:35:39,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:35:39,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:35:39,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:35:39,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:35:39,136 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:35:39,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i [2025-01-09 14:35:40,335 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/810bf5329/7c56f9dd5f7d44a1b61b8fa953e50eae/FLAG7a9bbc975 [2025-01-09 14:35:40,543 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:35:40,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i [2025-01-09 14:35:40,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/810bf5329/7c56f9dd5f7d44a1b61b8fa953e50eae/FLAG7a9bbc975 [2025-01-09 14:35:40,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/810bf5329/7c56f9dd5f7d44a1b61b8fa953e50eae [2025-01-09 14:35:40,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:35:40,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:35:40,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:35:40,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:35:40,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:35:40,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:35:40" (1/1) ... [2025-01-09 14:35:40,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508b148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:40, skipping insertion in model container [2025-01-09 14:35:40,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:35:40" (1/1) ... [2025-01-09 14:35:40,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:35:41,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i[915,928] [2025-01-09 14:35:41,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:35:41,088 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:35:41,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-43.i[915,928] [2025-01-09 14:35:41,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:35:41,121 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:35:41,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41 WrapperNode [2025-01-09 14:35:41,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:35:41,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:35:41,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:35:41,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:35:41,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,145 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-01-09 14:35:41,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:35:41,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:35:41,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:35:41,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:35:41,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,161 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-01-09 14:35:41,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:35:41,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:35:41,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:35:41,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:35:41,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (1/1) ... [2025-01-09 14:35:41,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:41,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:35:41,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:35:41,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:35:41,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:35:41,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:35:41,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:35:41,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:35:41,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:35:41,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:35:41,297 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:35:41,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:35:56,174 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:35:56,174 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:35:56,184 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:35:56,184 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:35:56,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:56 BoogieIcfgContainer [2025-01-09 14:35:56,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:35:56,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:35:56,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:35:56,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:35:56,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:35:40" (1/3) ... [2025-01-09 14:35:56,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5329668c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:35:56, skipping insertion in model container [2025-01-09 14:35:56,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:41" (2/3) ... [2025-01-09 14:35:56,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5329668c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:35:56, skipping insertion in model container [2025-01-09 14:35:56,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:56" (3/3) ... [2025-01-09 14:35:56,192 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-43.i [2025-01-09 14:35:56,202 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:35:56,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-43.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:35:56,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:35:56,242 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;@377e525c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:35:56,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:35:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:35:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 14:35:56,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:56,251 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:35:56,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1242397310, now seen corresponding path program 1 times [2025-01-09 14:35:56,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:35:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517021945] [2025-01-09 14:35:56,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:56,264 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-01-09 14:35:56,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:35:56,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 14:35:56,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 14:35:56,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:35:57,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:35:57,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:57,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:57,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:35:57,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:35:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-01-09 14:35:57,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:35:57,158 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:35:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517021945] [2025-01-09 14:35:57,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517021945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:35:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:35:57,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:35:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29007864] [2025-01-09 14:35:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:35:57,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:35:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:35:57,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:35:57,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:35:57,175 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:35:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:35:57,187 INFO L93 Difference]: Finished difference Result 84 states and 133 transitions. [2025-01-09 14:35:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:35:57,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-01-09 14:35:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:35:57,192 INFO L225 Difference]: With dead ends: 84 [2025-01-09 14:35:57,192 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 14:35:57,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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-01-09 14:35:57,196 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:35:57,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:35:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 14:35:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 14:35:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:35:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-01-09 14:35:57,227 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2025-01-09 14:35:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:35:57,227 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-01-09 14:35:57,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:35:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-01-09 14:35:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 14:35:57,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:57,230 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:35:57,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:35:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 14:35:57,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:57,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash 516108990, now seen corresponding path program 1 times [2025-01-09 14:35:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:35:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900513556] [2025-01-09 14:35:57,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:57,434 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-01-09 14:35:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:35:57,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 14:35:57,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 14:35:57,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:35:58,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:35:58,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:58,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:58,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 14:35:58,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:35:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 14:35:59,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:36:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 14:36:01,835 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:36:01,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900513556] [2025-01-09 14:36:01,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900513556] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:36:01,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:36:01,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-01-09 14:36:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798545288] [2025-01-09 14:36:01,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:36:01,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:36:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:36:01,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:36:01,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:36:01,837 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:36:09,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:36:13,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:36:17,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:36:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:36:17,034 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-01-09 14:36:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:36:17,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 82 [2025-01-09 14:36:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:36:17,187 INFO L225 Difference]: With dead ends: 89 [2025-01-09 14:36:17,187 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 14:36:17,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:36:17,188 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 109 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 75 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:36:17,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 90 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 14.0s Time] [2025-01-09 14:36:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 14:36:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-01-09 14:36:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:36:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-01-09 14:36:17,205 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 82 [2025-01-09 14:36:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:36:17,206 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-01-09 14:36:17,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:36:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2025-01-09 14:36:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 14:36:17,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:36:17,212 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:36:17,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 14:36:17,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 14:36:17,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:36:17,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:36:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash 517956032, now seen corresponding path program 1 times [2025-01-09 14:36:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:36:17,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125790808] [2025-01-09 14:36:17,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:36:17,417 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-01-09 14:36:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:36:17,421 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 14:36:17,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 14:36:17,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:36:18,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:36:18,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:36:18,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:36:18,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:36:19,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:36:42,117 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:36:50,379 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:36:58,543 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:37:07,015 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:37:11,101 WARN L851 $PredicateComparison]: unable to prove that (and (bvsle ((_ zero_extend 24) c_~var_1_19~0) (_ bv0 32)) (fp.geq c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= c_~var_1_8~0 c_~var_1_12~0) (fp.eq (fp.neg (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0) c_~var_1_9~0)) c_~last_1_var_1_8~0) (fp.leq c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2025-01-09 14:37:15,240 WARN L873 $PredicateComparison]: unable to prove that (and (bvsle ((_ zero_extend 24) c_~var_1_19~0) (_ bv0 32)) (fp.geq c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= c_~var_1_8~0 c_~var_1_12~0) (fp.eq (fp.neg (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0) c_~var_1_9~0)) c_~last_1_var_1_8~0) (fp.leq c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true