./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 127e3a0cb76048ef1bf90b67c9d3d0888a5502aaa9e60e916cbe6b2df2fd80c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:22,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:22,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:04:22,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:22,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:22,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:22,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:22,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:22,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:22,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:22,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:22,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:22,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:22,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:22,590 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:22,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:22,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:22,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:22,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:22,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:22,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:22,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 127e3a0cb76048ef1bf90b67c9d3d0888a5502aaa9e60e916cbe6b2df2fd80c6 [2025-03-04 00:04:22,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:22,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:22,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:22,845 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:22,845 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:22,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i [2025-03-04 00:04:23,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d39e472df/bd31f4ab8b014fcc88993785d6effe9b/FLAG4ffcdaa8d [2025-03-04 00:04:24,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:24,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i [2025-03-04 00:04:24,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d39e472df/bd31f4ab8b014fcc88993785d6effe9b/FLAG4ffcdaa8d [2025-03-04 00:04:24,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d39e472df/bd31f4ab8b014fcc88993785d6effe9b [2025-03-04 00:04:24,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:24,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:24,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:24,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:24,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:24,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24, skipping insertion in model container [2025-03-04 00:04:24,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:24,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i[915,928] [2025-03-04 00:04:24,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:24,676 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:24,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i[915,928] [2025-03-04 00:04:24,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:24,707 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:24,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24 WrapperNode [2025-03-04 00:04:24,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:24,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:24,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:24,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:24,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,736 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2025-03-04 00:04:24,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:24,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:24,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:24,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:24,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:04:24,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:24,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:24,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:24,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:24,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (1/1) ... [2025-03-04 00:04:24,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:24,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:24,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:04:24,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:04:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:24,824 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:04:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:24,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:24,873 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:24,875 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:24,993 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:24,993 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:24,999 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:24,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:25,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:24 BoogieIcfgContainer [2025-03-04 00:04:25,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:25,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:25,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:25,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:25,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:24" (1/3) ... [2025-03-04 00:04:25,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae1d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:25, skipping insertion in model container [2025-03-04 00:04:25,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:24" (2/3) ... [2025-03-04 00:04:25,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae1d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:25, skipping insertion in model container [2025-03-04 00:04:25,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:24" (3/3) ... [2025-03-04 00:04:25,006 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-38.i [2025-03-04 00:04:25,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:25,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-38.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:25,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:25,068 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;@35ff2f7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:25,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 00:04:25,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:25,076 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:25,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash 294055423, now seen corresponding path program 1 times [2025-03-04 00:04:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220127846] [2025-03-04 00:04:25,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:25,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:25,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:25,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:25,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 00:04:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:04:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220127846] [2025-03-04 00:04:25,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220127846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:04:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392437844] [2025-03-04 00:04:25,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:04:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:25,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:04:25,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:04:25,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:25,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:25,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:25,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:25,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:25,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 00:04:25,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392437844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:04:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:04:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682690252] [2025-03-04 00:04:25,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:25,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:04:25,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:25,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:25,334 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:04:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:25,348 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2025-03-04 00:04:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:25,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-03-04 00:04:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:25,353 INFO L225 Difference]: With dead ends: 60 [2025-03-04 00:04:25,353 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:04:25,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:25,360 INFO L435 NwaCegarLoop]: 38 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, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:25,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:04:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:04:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-04 00:04:25,389 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 55 [2025-03-04 00:04:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:25,389 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-04 00:04:25,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:04:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-04 00:04:25,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 00:04:25,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:25,391 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:25,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:04:25,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:04:25,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:25,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash -922930207, now seen corresponding path program 1 times [2025-03-04 00:04:25,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:25,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480382425] [2025-03-04 00:04:25,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:25,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:25,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:25,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:25,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:25,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 00:04:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:04:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480382425] [2025-03-04 00:04:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480382425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:04:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549625246] [2025-03-04 00:04:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:26,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:04:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:04:26,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:04:26,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:04:26,190 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:04:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:26,283 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-04 00:04:26,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:04:26,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2025-03-04 00:04:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:26,284 INFO L225 Difference]: With dead ends: 50 [2025-03-04 00:04:26,284 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 00:04:26,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:04:26,285 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:26,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 206 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 00:04:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-04 00:04:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:04:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-04 00:04:26,293 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 55 [2025-03-04 00:04:26,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:26,293 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-04 00:04:26,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:04:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-03-04 00:04:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:04:26,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:26,294 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:04:26,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:26,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1427214087, now seen corresponding path program 1 times [2025-03-04 00:04:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479187992] [2025-03-04 00:04:26,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:26,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:04:26,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:04:26,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:26,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:26,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:04:26,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:04:26,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:04:26,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:26,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:26,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:04:26,366 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:04:26,366 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:04:26,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:04:26,372 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:04:26,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:04:26,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:04:26 BoogieIcfgContainer [2025-03-04 00:04:26,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:04:26,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:04:26,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:04:26,409 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:04:26,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:24" (3/4) ... [2025-03-04 00:04:26,412 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:04:26,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:04:26,415 INFO L158 Benchmark]: Toolchain (without parser) took 1884.02ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 64.6MB in the end (delta: 60.3MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2025-03-04 00:04:26,415 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:26,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.42ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 112.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:26,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.88ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.4MB in the end (delta: 997.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:26,416 INFO L158 Benchmark]: Boogie Preprocessor took 34.31ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:26,416 INFO L158 Benchmark]: IcfgBuilder took 225.93ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 97.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:26,417 INFO L158 Benchmark]: TraceAbstraction took 1405.74ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 64.7MB in the end (delta: 31.8MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-03-04 00:04:26,417 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 167.8MB. Free memory was 64.7MB in the beginning and 64.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:26,418 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.24ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.42ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 112.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.88ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.4MB in the end (delta: 997.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.31ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 225.93ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 97.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1405.74ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 64.7MB in the end (delta: 31.8MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 167.8MB. Free memory was 64.7MB in the beginning and 64.6MB in the end (delta: 50.8kB). 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 52, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 256.2; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned short int var_1_5 = 0; [L26] float var_1_6 = 10.125; [L27] float var_1_7 = 9.4; [L28] unsigned long int var_1_8 = 50; VAL [isInitial=0, var_1_1=1281/5, var_1_2=0, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L63] isInitial = 1 [L64] FCALL initially() [L65] COND TRUE 1 [L66] FCALL updateLastVariables() [L67] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1281/5, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L48] var_1_5 = __VERIFIER_nondet_ushort() [L49] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L49] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L50] CALL assume_abort_if_not(var_1_5 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L50] RET assume_abort_if_not(var_1_5 <= 65535) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_6=81/8, var_1_7=47/5, var_1_8=50] [L51] var_1_6 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_7=47/5, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_7=47/5, var_1_8=50] [L52] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_7=47/5, var_1_8=50] [L53] var_1_7 = __VERIFIER_nondet_float() [L54] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_8=50] [L54] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_8=50] [L67] RET updateVariables() [L68] CALL step() [L32] var_1_8 = var_1_5 VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_8=0] [L33] COND TRUE var_1_2 || var_1_3 VAL [isInitial=1, var_1_1=1281/5, var_1_2=1, var_1_3=1, var_1_5=0, var_1_8=0] [L34] COND FALSE !(var_1_8 != var_1_8) [L37] var_1_1 = var_1_6 VAL [isInitial=1, var_1_1=261, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=261, var_1_8=0] [L68] RET step() [L69] CALL, EXPR property() [L59-L60] return ((var_1_2 || var_1_3) ? ((var_1_8 != var_1_8) ? (var_1_1 == ((float) ((((-0.4f) > (((((var_1_6 + var_1_7) < 0 ) ? -(var_1_6 + var_1_7) : (var_1_6 + var_1_7))))) ? (-0.4f) : (((((var_1_6 + var_1_7) < 0 ) ? -(var_1_6 + var_1_7) : (var_1_6 + var_1_7)))))))) : (var_1_1 == ((float) var_1_6))) : 1) && (var_1_8 == ((unsigned long int) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_1=261, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=261, var_1_8=0] [L69] RET, EXPR property() [L69] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=261, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=261, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=261, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=261, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 88 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, InterpolantAutomatonStates: 8, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 322/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:04:26,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 127e3a0cb76048ef1bf90b67c9d3d0888a5502aaa9e60e916cbe6b2df2fd80c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:28,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:28,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:04:28,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:28,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:28,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:28,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:28,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:28,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:28,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:28,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:28,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:28,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:28,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:28,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:28,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:28,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:28,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:28,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:28,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:28,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:28,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:28,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:04:28,341 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:04:28,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:28,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:28,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:28,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:28,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 127e3a0cb76048ef1bf90b67c9d3d0888a5502aaa9e60e916cbe6b2df2fd80c6 [2025-03-04 00:04:28,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:28,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:28,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:28,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:28,581 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:28,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i [2025-03-04 00:04:29,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b72dc0ef/02f161ccb4bc470498af6888e1ad507b/FLAG51a9227be [2025-03-04 00:04:29,954 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:29,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i [2025-03-04 00:04:29,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b72dc0ef/02f161ccb4bc470498af6888e1ad507b/FLAG51a9227be [2025-03-04 00:04:29,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b72dc0ef/02f161ccb4bc470498af6888e1ad507b [2025-03-04 00:04:29,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:29,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:29,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:29,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:29,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:29,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:29" (1/1) ... [2025-03-04 00:04:29,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42825539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:29, skipping insertion in model container [2025-03-04 00:04:29,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:29" (1/1) ... [2025-03-04 00:04:29,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:30,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i[915,928] [2025-03-04 00:04:30,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:30,132 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:30,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-38.i[915,928] [2025-03-04 00:04:30,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:30,158 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:30,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30 WrapperNode [2025-03-04 00:04:30,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:30,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:30,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:30,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:30,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,183 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2025-03-04 00:04:30,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:30,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:30,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:30,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:30,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,197 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:04:30,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:30,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:30,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:30,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:30,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (1/1) ... [2025-03-04 00:04:30,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:30,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:30,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:04:30,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:04:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:04:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:30,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:30,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:30,302 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:30,303 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:30,447 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:30,448 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:30,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:30,455 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:30,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:30 BoogieIcfgContainer [2025-03-04 00:04:30,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:30,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:30,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:30,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:30,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:29" (1/3) ... [2025-03-04 00:04:30,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0b349e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:30, skipping insertion in model container [2025-03-04 00:04:30,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:30" (2/3) ... [2025-03-04 00:04:30,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0b349e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:30, skipping insertion in model container [2025-03-04 00:04:30,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:30" (3/3) ... [2025-03-04 00:04:30,465 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-38.i [2025-03-04 00:04:30,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:30,476 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-38.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:30,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:30,515 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e0e40cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:30,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 00:04:30,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:30,524 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:30,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash 294055423, now seen corresponding path program 1 times [2025-03-04 00:04:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953582525] [2025-03-04 00:04:30,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:30,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:30,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:30,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:04:30,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:04:30,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:30,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:30,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:30,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:30,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 00:04:30,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:30,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:30,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953582525] [2025-03-04 00:04:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953582525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:30,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:04:30,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263610502] [2025-03-04 00:04:30,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:30,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:30,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:30,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:30,701 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:04:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:30,717 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2025-03-04 00:04:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-03-04 00:04:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:30,723 INFO L225 Difference]: With dead ends: 60 [2025-03-04 00:04:30,724 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:04:30,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:30,728 INFO L435 NwaCegarLoop]: 38 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, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:30,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:04:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:04:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-04 00:04:30,758 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 55 [2025-03-04 00:04:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:30,758 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-04 00:04:30,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:04:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-04 00:04:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 00:04:30,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:30,760 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:30,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:04:30,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:30,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:30,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -922930207, now seen corresponding path program 1 times [2025-03-04 00:04:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262001902] [2025-03-04 00:04:30,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:30,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:04:30,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:04:31,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:31,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:31,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:31,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:31,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:04:31,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 00:04:31,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:31,220 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:31,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262001902] [2025-03-04 00:04:31,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262001902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:31,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:04:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008370903] [2025-03-04 00:04:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:31,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:04:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:31,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:04:31,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:04:31,222 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:04:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:31,293 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-04 00:04:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:04:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2025-03-04 00:04:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:31,295 INFO L225 Difference]: With dead ends: 50 [2025-03-04 00:04:31,295 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 00:04:31,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:04:31,296 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:31,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 182 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 00:04:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-04 00:04:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:04:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-04 00:04:31,303 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 55 [2025-03-04 00:04:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:31,303 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-04 00:04:31,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:04:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-03-04 00:04:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:04:31,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:31,304 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:31,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:04:31,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:31,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1427214087, now seen corresponding path program 1 times [2025-03-04 00:04:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579696804] [2025-03-04 00:04:31,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:31,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:31,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:31,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:04:31,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:04:31,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:04:31,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:04:31,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:31,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:31,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:04:31,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 00:04:32,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:04:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 00:04:32,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:32,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579696804] [2025-03-04 00:04:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579696804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:04:32,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:04:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-04 00:04:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424819435] [2025-03-04 00:04:32,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:04:32,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:04:32,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:32,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:04:32,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:04:32,300 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 00:04:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:33,155 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2025-03-04 00:04:33,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:04:33,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 56 [2025-03-04 00:04:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:33,157 INFO L225 Difference]: With dead ends: 68 [2025-03-04 00:04:33,157 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:04:33,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:04:33,158 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:33,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 256 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:04:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:04:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:04:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:04:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:04:33,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-03-04 00:04:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:33,159 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:04:33,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 00:04:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:04:33,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:04:33,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:04:33,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 00:04:33,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:04:33,369 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:04:33,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:04:33,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:04:33,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:04:33,900 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:33,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:33,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:33,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:33,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:04:33,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:04:33 BoogieIcfgContainer [2025-03-04 00:04:33,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:04:33,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:04:33,904 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:04:33,904 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:04:33,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:30" (3/4) ... [2025-03-04 00:04:33,906 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:04:33,910 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:04:33,913 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:04:33,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:04:33,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:04:33,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:04:33,969 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:04:33,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:04:33,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:04:33,971 INFO L158 Benchmark]: Toolchain (without parser) took 3990.62ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 67.3MB in the end (delta: 24.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:33,971 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 61.5MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:33,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.26ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 79.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:33,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.72ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:33,971 INFO L158 Benchmark]: Boogie Preprocessor took 24.03ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:33,972 INFO L158 Benchmark]: IcfgBuilder took 246.93ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 64.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:33,972 INFO L158 Benchmark]: TraceAbstraction took 3443.77ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 72.7MB in the end (delta: -8.7MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:33,972 INFO L158 Benchmark]: Witness Printer took 66.16ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 67.3MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:33,973 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.32ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 61.5MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.26ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 79.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.72ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.03ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 246.93ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 64.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3443.77ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 72.7MB in the end (delta: -8.7MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 66.16ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 67.3MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 476 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 345 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 131 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, InterpolantAutomatonStates: 27, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 652 SizeOfPredicates, 16 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 417/448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 00:04:33,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE