./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-95.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-95.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 d108156f6bbb1643a63c117926d89d2b1bdfe70b74930503a22a3dbb7e6dc546 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:03,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:03,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:07:03,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:03,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:03,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:03,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:03,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:03,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:03,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:03,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:03,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:03,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:03,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:03,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:03,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:03,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:03,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:03,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:03,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:03,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:03,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:03,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:03,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:03,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:03,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:03,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:07:03,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:07:03,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:03,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:03,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:03,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:03,412 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 -> d108156f6bbb1643a63c117926d89d2b1bdfe70b74930503a22a3dbb7e6dc546 [2025-03-04 00:07:03,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:03,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:03,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:03,669 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:03,669 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:03,671 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-95.i [2025-03-04 00:07:04,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2eb83450/460ffad97488428e94c54782e036c623/FLAGd6ae9b662 [2025-03-04 00:07:05,044 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:05,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-95.i [2025-03-04 00:07:05,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2eb83450/460ffad97488428e94c54782e036c623/FLAGd6ae9b662 [2025-03-04 00:07:05,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2eb83450/460ffad97488428e94c54782e036c623 [2025-03-04 00:07:05,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:05,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:05,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:05,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:05,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:05,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a317b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05, skipping insertion in model container [2025-03-04 00:07:05,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:05,512 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-95.i[915,928] [2025-03-04 00:07:05,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:05,550 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:05,561 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-95.i[915,928] [2025-03-04 00:07:05,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:05,590 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:05,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05 WrapperNode [2025-03-04 00:07:05,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:05,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:05,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:05,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:05,597 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:07:05" (1/1) ... [2025-03-04 00:07:05,608 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:07:05" (1/1) ... [2025-03-04 00:07:05,624 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-04 00:07:05,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:05,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:05,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:05,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:05,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,653 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:07:05,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:05,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:05,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:05,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:05,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (1/1) ... [2025-03-04 00:07:05,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:05,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:05,692 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:07:05,699 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:07:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:07:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:05,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:05,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:05,896 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:05,896 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:05,906 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:05,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:05,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:05 BoogieIcfgContainer [2025-03-04 00:07:05,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:05,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:05,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:05,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:05,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:05" (1/3) ... [2025-03-04 00:07:05,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54388907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:05, skipping insertion in model container [2025-03-04 00:07:05,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:05" (2/3) ... [2025-03-04 00:07:05,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54388907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:05, skipping insertion in model container [2025-03-04 00:07:05,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:05" (3/3) ... [2025-03-04 00:07:05,915 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-95.i [2025-03-04 00:07:05,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:05,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-95.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:05,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:05,983 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;@46055692, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:05,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:07:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:07:05,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:05,995 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:05,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash -932467687, now seen corresponding path program 1 times [2025-03-04 00:07:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:06,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797375428] [2025-03-04 00:07:06,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:06,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:07:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:07:06,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:06,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 00:07:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797375428] [2025-03-04 00:07:06,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797375428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:06,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762013876] [2025-03-04 00:07:06,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:06,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:06,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:06,146 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:07:06,148 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:07:06,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:07:06,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:07:06,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:06,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:06,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:07:06,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 00:07:06,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762013876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:06,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:07:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304604145] [2025-03-04 00:07:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:06,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:07:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:06,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:07:06,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:06,275 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:07:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:06,287 INFO L93 Difference]: Finished difference Result 70 states and 105 transitions. [2025-03-04 00:07:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:07:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-03-04 00:07:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:06,292 INFO L225 Difference]: With dead ends: 70 [2025-03-04 00:07:06,292 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 00:07:06,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:06,296 INFO L435 NwaCegarLoop]: 45 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, 45 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:07:06,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 00:07:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 00:07:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:07:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-03-04 00:07:06,327 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 69 [2025-03-04 00:07:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:06,327 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-04 00:07:06,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:07:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2025-03-04 00:07:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:07:06,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:06,331 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:06,338 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:07:06,532 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:07:06,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:06,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1485864595, now seen corresponding path program 1 times [2025-03-04 00:07:06,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:06,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951877097] [2025-03-04 00:07:06,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:06,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:07:06,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:07:06,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:06,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:07:06,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:07:06,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:07:06,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:07:06,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:06,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:07:06,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:07:06,674 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:07:06,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:07:06,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:07:06,679 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:07:06,723 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:07:06,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:07:06 BoogieIcfgContainer [2025-03-04 00:07:06,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:07:06,727 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:07:06,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:07:06,727 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:07:06,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:05" (3/4) ... [2025-03-04 00:07:06,729 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:07:06,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:07:06,730 INFO L158 Benchmark]: Toolchain (without parser) took 1330.78ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 37.1MB in the end (delta: 68.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 00:07:06,731 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:06,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.08ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:06,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.99ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:06,731 INFO L158 Benchmark]: Boogie Preprocessor took 37.35ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:06,731 INFO L158 Benchmark]: IcfgBuilder took 243.05ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 77.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:06,732 INFO L158 Benchmark]: TraceAbstraction took 816.96ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 37.1MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 00:07:06,732 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 142.6MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:06,733 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.08ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.99ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.35ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 243.05ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 77.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 816.96ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 37.1MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 142.6MB. Free memory is still 37.1MB. 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 someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.5; [L23] double var_1_2 = 9.4; [L24] double var_1_3 = 7.8; [L25] double var_1_4 = 127.84; [L26] double var_1_5 = 999999999.5; [L27] double var_1_6 = 0.0; [L28] double var_1_7 = 9999999.8; [L29] unsigned short int var_1_8 = 10; [L30] unsigned short int var_1_9 = 5; [L31] signed char var_1_10 = 4; [L32] signed char var_1_11 = -16; VAL [isInitial=0, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_2=47/5, var_1_3=39/5, var_1_4=3196/25, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_3=39/5, var_1_4=3196/25, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_3=39/5, var_1_4=3196/25, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L46] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_3=39/5, var_1_4=3196/25, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L47] var_1_3 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_4=3196/25, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_4=3196/25, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L48] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_4=3196/25, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L49] var_1_4 = __VERIFIER_nondet_double() [L50] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L50] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_5=1999999999/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L51] var_1_5 = __VERIFIER_nondet_double() [L52] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L52] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_6=0, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L53] var_1_6 = __VERIFIER_nondet_double() [L54] CALL assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L54] RET assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_7=49999999/5, var_1_8=10, var_1_9=5] [L55] var_1_7 = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not((var_1_7 >= 0.0F && 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_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10, var_1_9=5] [L56] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10, var_1_9=5] [L57] var_1_9 = __VERIFIER_nondet_ushort() [L58] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10] [L58] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10] [L59] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10, var_1_9=0] [L59] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, var_1_10=4, var_1_11=-16, var_1_1=49/2, var_1_8=10, var_1_9=0] [L60] var_1_11 = __VERIFIER_nondet_char() [L61] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-127, var_1_1=49/2, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-127, var_1_1=49/2, var_1_8=10, var_1_9=0] [L61] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, var_1_10=4, var_1_11=-127, var_1_1=49/2, var_1_8=10, var_1_9=0] [L62] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-127, var_1_1=49/2, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=-127, var_1_1=49/2, var_1_8=10, var_1_9=0] [L62] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=4, var_1_11=-127, var_1_1=49/2, var_1_8=10, var_1_9=0] [L75] RET updateVariables() [L76] CALL step() [L36] COND TRUE var_1_2 < (var_1_3 - 9.108) [L37] var_1_1 = ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) VAL [isInitial=1, var_1_10=4, var_1_11=-127, var_1_1=1000000004, var_1_4=1000000004, var_1_5=1000000004, var_1_8=10, var_1_9=0] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=-127, var_1_11=-127, var_1_1=1000000004, var_1_4=1000000004, var_1_5=1000000004, var_1_8=0, var_1_9=0] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return (((var_1_2 < (var_1_3 - 9.108)) ? (var_1_1 == ((double) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : (var_1_1 == ((double) ((var_1_6 - var_1_7) - 32.925)))) && (var_1_8 == ((unsigned short int) var_1_9))) && (var_1_10 == ((signed char) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=-127, var_1_11=-127, var_1_1=1000000004, var_1_4=1000000004, var_1_5=1000000004, var_1_8=0, var_1_9=0] [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-127, var_1_11=-127, var_1_1=1000000004, var_1_4=1000000004, var_1_5=1000000004, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-127, var_1_11=-127, var_1_1=1000000004, var_1_4=1000000004, var_1_5=1000000004, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 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:07:06,747 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-95.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 d108156f6bbb1643a63c117926d89d2b1bdfe70b74930503a22a3dbb7e6dc546 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:08,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:08,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:07:08,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:08,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:08,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:08,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:08,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:08,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:08,756 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:08,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:08,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:08,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:08,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:08,757 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:08,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:08,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:08,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:08,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:08,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:08,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:08,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:08,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:08,759 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:07:08,759 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:07:08,759 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:07:08,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:08,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:08,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:08,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:08,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:08,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:07:08,760 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:07:08,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:08,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:08,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:08,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:08,761 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 -> d108156f6bbb1643a63c117926d89d2b1bdfe70b74930503a22a3dbb7e6dc546 [2025-03-04 00:07:09,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:09,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:09,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:09,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:09,022 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:09,023 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-95.i [2025-03-04 00:07:10,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e211ce40c/3b8491298345489986e758c5fe156803/FLAG01b23e753 [2025-03-04 00:07:11,075 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:11,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-95.i [2025-03-04 00:07:11,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e211ce40c/3b8491298345489986e758c5fe156803/FLAG01b23e753 [2025-03-04 00:07:11,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e211ce40c/3b8491298345489986e758c5fe156803 [2025-03-04 00:07:11,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:11,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:11,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:11,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:11,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:11,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5210cd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11, skipping insertion in model container [2025-03-04 00:07:11,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:11,239 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-95.i[915,928] [2025-03-04 00:07:11,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:11,283 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:11,291 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-95.i[915,928] [2025-03-04 00:07:11,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:11,319 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:11,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11 WrapperNode [2025-03-04 00:07:11,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:11,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:11,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:11,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:11,329 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:07:11" (1/1) ... [2025-03-04 00:07:11,343 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:07:11" (1/1) ... [2025-03-04 00:07:11,359 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-04 00:07:11,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:11,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:11,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:11,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:11,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,381 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:07:11,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:11,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:11,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:11,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:11,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (1/1) ... [2025-03-04 00:07:11,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:11,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:11,430 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:07:11,433 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:07:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:07:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:11,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:11,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:11,499 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:11,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:16,375 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:16,375 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:16,382 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:16,382 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:16,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:16 BoogieIcfgContainer [2025-03-04 00:07:16,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:16,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:16,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:16,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:16,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:11" (1/3) ... [2025-03-04 00:07:16,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dabfde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:16, skipping insertion in model container [2025-03-04 00:07:16,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:11" (2/3) ... [2025-03-04 00:07:16,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dabfde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:16, skipping insertion in model container [2025-03-04 00:07:16,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:16" (3/3) ... [2025-03-04 00:07:16,391 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-95.i [2025-03-04 00:07:16,401 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:16,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-95.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:16,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:16,454 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;@431ec6a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:16,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:07:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:07:16,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:16,463 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:16,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:16,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash -932467687, now seen corresponding path program 1 times [2025-03-04 00:07:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:07:16,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461510904] [2025-03-04 00:07:16,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:16,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:16,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:07:16,481 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:07:16,483 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:07:16,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:07:16,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:07:16,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:16,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:16,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:07:16,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-04 00:07:16,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:16,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:07:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461510904] [2025-03-04 00:07:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461510904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:16,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:16,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:07:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335360427] [2025-03-04 00:07:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:16,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:07:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:07:16,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:07:16,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:16,813 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:07:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:16,826 INFO L93 Difference]: Finished difference Result 70 states and 105 transitions. [2025-03-04 00:07:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:07:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-03-04 00:07:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:16,831 INFO L225 Difference]: With dead ends: 70 [2025-03-04 00:07:16,832 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 00:07:16,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:07:16,835 INFO L435 NwaCegarLoop]: 45 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, 45 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:07:16,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 00:07:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 00:07:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:07:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-03-04 00:07:16,860 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 69 [2025-03-04 00:07:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:16,861 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-04 00:07:16,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:07:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2025-03-04 00:07:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:07:16,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:16,864 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:16,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:07:17,065 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:07:17,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:17,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1485864595, now seen corresponding path program 1 times [2025-03-04 00:07:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:07:17,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266658410] [2025-03-04 00:07:17,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:07:17,071 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:07:17,073 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:07:17,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:07:17,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:07:17,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:17,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:07:17,362 INFO L279 TraceCheckSpWp]: Computing forward predicates...