./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/neural-networks/exp_3_safe.c-amalgamation.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/neural-networks/exp_3_safe.c-amalgamation.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 1dd37f77a4dffee86b91224c7c955520c92cbe7ede1508833f89e1827406961d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 03:40:55,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 03:40:56,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 03:40:56,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 03:40:56,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 03:40:56,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 03:40:56,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 03:40:56,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 03:40:56,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 03:40:56,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 03:40:56,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 03:40:56,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 03:40:56,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 03:40:56,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 03:40:56,038 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 03:40:56,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 03:40:56,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 03:40:56,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 03:40:56,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 03:40:56,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 03:40:56,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 03:40:56,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 03:40:56,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 03:40:56,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 03:40:56,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:40:56,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 03:40:56,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 03:40:56,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 03:40:56,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 03:40:56,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 03:40:56,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 03:40:56,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 03:40:56,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 03:40:56,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 03:40:56,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 03:40:56,041 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 -> 1dd37f77a4dffee86b91224c7c955520c92cbe7ede1508833f89e1827406961d [2025-03-08 03:40:56,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 03:40:56,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 03:40:56,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 03:40:56,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 03:40:56,289 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 03:40:56,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/exp_3_safe.c-amalgamation.i [2025-03-08 03:40:57,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4932e17e/be55bbf3118a437e822655d614cc8f2f/FLAGc059ae37a [2025-03-08 03:40:57,715 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 03:40:57,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/exp_3_safe.c-amalgamation.i [2025-03-08 03:40:57,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4932e17e/be55bbf3118a437e822655d614cc8f2f/FLAGc059ae37a [2025-03-08 03:40:57,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4932e17e/be55bbf3118a437e822655d614cc8f2f [2025-03-08 03:40:57,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 03:40:57,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 03:40:57,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 03:40:57,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 03:40:57,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 03:40:57,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:40:57" (1/1) ... [2025-03-08 03:40:57,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb036d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57, skipping insertion in model container [2025-03-08 03:40:57,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:40:57" (1/1) ... [2025-03-08 03:40:58,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 03:40:58,491 WARN L1731 CHandler]: Possible shadowing of function y1 [2025-03-08 03:40:58,491 WARN L1731 CHandler]: Possible shadowing of function y1 [2025-03-08 03:40:58,495 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/neural-networks/exp_3_safe.c-amalgamation.i[63145,63158] [2025-03-08 03:40:58,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:40:58,503 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 03:40:58,555 WARN L1731 CHandler]: Possible shadowing of function y1 [2025-03-08 03:40:58,555 WARN L1731 CHandler]: Possible shadowing of function y1 [2025-03-08 03:40:58,556 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/neural-networks/exp_3_safe.c-amalgamation.i[63145,63158] [2025-03-08 03:40:58,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:40:58,628 INFO L204 MainTranslator]: Completed translation [2025-03-08 03:40:58,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58 WrapperNode [2025-03-08 03:40:58,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 03:40:58,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 03:40:58,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 03:40:58,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 03:40:58,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,664 INFO L138 Inliner]: procedures = 557, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-03-08 03:40:58,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 03:40:58,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 03:40:58,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 03:40:58,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 03:40:58,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,679 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-08 03:40:58,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 03:40:58,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 03:40:58,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 03:40:58,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 03:40:58,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (1/1) ... [2025-03-08 03:40:58,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:40:58,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 03:40:58,710 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-08 03:40:58,712 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-08 03:40:58,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 03:40:58,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 03:40:58,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 03:40:58,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 03:40:58,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 03:40:58,801 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 03:40:58,804 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 03:40:58,863 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-08 03:40:58,864 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 03:40:58,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 03:40:58,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 03:40:58,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:40:58 BoogieIcfgContainer [2025-03-08 03:40:58,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 03:40:58,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 03:40:58,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 03:40:58,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 03:40:58,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:40:57" (1/3) ... [2025-03-08 03:40:58,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae1c157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:40:58, skipping insertion in model container [2025-03-08 03:40:58,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:58" (2/3) ... [2025-03-08 03:40:58,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae1c157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:40:58, skipping insertion in model container [2025-03-08 03:40:58,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:40:58" (3/3) ... [2025-03-08 03:40:58,887 INFO L128 eAbstractionObserver]: Analyzing ICFG exp_3_safe.c-amalgamation.i [2025-03-08 03:40:58,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 03:40:58,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exp_3_safe.c-amalgamation.i that has 1 procedures, 11 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 03:40:58,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 03:40:58,944 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;@5a8bffea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 03:40:58,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 03:40:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-08 03:40:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 03:40:58,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:40:58,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 03:40:58,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:40:58,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:40:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1211904766, now seen corresponding path program 1 times [2025-03-08 03:40:58,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 03:40:58,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420715003] [2025-03-08 03:40:58,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:40:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 03:40:59,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 03:40:59,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 03:40:59,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:40:59,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:40:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:40:59,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 03:40:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420715003] [2025-03-08 03:40:59,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420715003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:40:59,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:40:59,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 03:40:59,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181954103] [2025-03-08 03:40:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:40:59,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 03:40:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 03:40:59,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 03:40:59,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 03:40:59,066 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 03:40:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:40:59,072 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-03-08 03:40:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 03:40:59,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2025-03-08 03:40:59,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:40:59,078 INFO L225 Difference]: With dead ends: 19 [2025-03-08 03:40:59,078 INFO L226 Difference]: Without dead ends: 7 [2025-03-08 03:40:59,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-08 03:40:59,084 INFO L435 NwaCegarLoop]: 10 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, 10 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-08 03:40:59,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:40:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-08 03:40:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-08 03:40:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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-08 03:40:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2025-03-08 03:40:59,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 6 [2025-03-08 03:40:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:40:59,104 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2025-03-08 03:40:59,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 03:40:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2025-03-08 03:40:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 03:40:59,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:40:59,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 03:40:59,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 03:40:59,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:40:59,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:40:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1211934557, now seen corresponding path program 1 times [2025-03-08 03:40:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 03:40:59,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035556924] [2025-03-08 03:40:59,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:40:59,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 03:40:59,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 03:40:59,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 03:40:59,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:40:59,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 03:40:59,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 03:40:59,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 03:40:59,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 03:40:59,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:40:59,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 03:40:59,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 03:40:59,131 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 03:40:59,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 03:40:59,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 03:40:59,135 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 03:40:59,141 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 03:40:59,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:40:59 BoogieIcfgContainer [2025-03-08 03:40:59,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 03:40:59,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 03:40:59,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 03:40:59,146 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 03:40:59,146 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:40:58" (3/4) ... [2025-03-08 03:40:59,148 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 03:40:59,148 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 03:40:59,149 INFO L158 Benchmark]: Toolchain (without parser) took 1155.88ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 84.8MB in the end (delta: 17.9MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2025-03-08 03:40:59,150 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:40:59,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.22ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 46.6MB in the end (delta: 56.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 03:40:59,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.49ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 44.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:40:59,150 INFO L158 Benchmark]: Boogie Preprocessor took 20.48ms. Allocated memory is still 142.6MB. Free memory was 44.6MB in the beginning and 42.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:40:59,150 INFO L158 Benchmark]: IcfgBuilder took 183.34ms. Allocated memory is still 142.6MB. Free memory was 42.6MB in the beginning and 33.7MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:40:59,150 INFO L158 Benchmark]: TraceAbstraction took 265.69ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 84.8MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 03:40:59,150 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 142.6MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:40:59,151 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.22ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 46.6MB in the end (delta: 56.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.49ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 44.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.48ms. Allocated memory is still 142.6MB. Free memory was 44.6MB in the beginning and 42.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 183.34ms. Allocated memory is still 142.6MB. Free memory was 42.6MB in the beginning and 33.7MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 265.69ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 84.8MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 142.6MB. Free memory is still 84.8MB. 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: 853]: 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 848, overapproximation of someBinaryFLOATComparisonOperation at line 853, overapproximation of someBinaryArithmeticFLOAToperation at line 849. Possible FailurePath: [L847] float x1 = __VERIFIER_nondet_float(); [L848] COND FALSE !(!(__builtin_isgreaterequal(x1, -88.0f) && __builtin_islessequal(x1, 88.0f))) [L849] float x2 = x1 + 1e-2f; [L850] float y1 = expf(x1); [L851] float y2 = expf(x2); [L852] float derivative = (y2 - y1) / 1e-2f; [L853] COND TRUE !(__builtin_isgreaterequal(derivative, y1)) [L853] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 12 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 1, 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, 10 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, 10 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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-08 03:40:59,167 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/neural-networks/exp_3_safe.c-amalgamation.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 1dd37f77a4dffee86b91224c7c955520c92cbe7ede1508833f89e1827406961d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 03:41:01,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 03:41:01,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 03:41:01,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 03:41:01,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 03:41:01,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 03:41:01,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 03:41:01,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 03:41:01,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 03:41:01,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 03:41:01,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 03:41:01,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 03:41:01,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 03:41:01,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 03:41:01,199 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 03:41:01,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 03:41:01,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 03:41:01,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 03:41:01,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 03:41:01,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 03:41:01,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 03:41:01,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 03:41:01,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 03:41:01,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 03:41:01,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 03:41:01,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 03:41:01,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:41:01,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 03:41:01,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 03:41:01,201 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 03:41:01,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 03:41:01,202 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 03:41:01,202 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 03:41:01,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 03:41:01,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 03:41:01,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 03:41:01,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 03:41:01,202 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 -> 1dd37f77a4dffee86b91224c7c955520c92cbe7ede1508833f89e1827406961d [2025-03-08 03:41:01,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 03:41:01,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 03:41:01,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 03:41:01,444 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 03:41:01,444 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 03:41:01,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/exp_3_safe.c-amalgamation.i [2025-03-08 03:41:02,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50620e8d8/d5ab74ff442e40b8ba70b5a18e935e13/FLAG4308ca19a [2025-03-08 03:41:02,845 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 03:41:02,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/exp_3_safe.c-amalgamation.i [2025-03-08 03:41:02,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50620e8d8/d5ab74ff442e40b8ba70b5a18e935e13/FLAG4308ca19a [2025-03-08 03:41:02,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50620e8d8/d5ab74ff442e40b8ba70b5a18e935e13 [2025-03-08 03:41:02,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 03:41:02,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 03:41:02,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 03:41:02,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 03:41:02,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 03:41:02,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:41:02" (1/1) ... [2025-03-08 03:41:02,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d65f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:02, skipping insertion in model container [2025-03-08 03:41:02,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:41:02" (1/1) ... [2025-03-08 03:41:02,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 03:41:03,303 WARN L1731 CHandler]: Possible shadowing of function y1 [2025-03-08 03:41:03,303 WARN L1731 CHandler]: Possible shadowing of function y1 [2025-03-08 03:41:03,306 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/neural-networks/exp_3_safe.c-amalgamation.i[63145,63158] [2025-03-08 03:41:03,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:41:03,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 03:41:03,349 WARN L1731 CHandler]: Possible shadowing of function y1 [2025-03-08 03:41:03,349 WARN L1731 CHandler]: Possible shadowing of function y1 [2025-03-08 03:41:03,349 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/neural-networks/exp_3_safe.c-amalgamation.i[63145,63158] [2025-03-08 03:41:03,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:41:03,455 INFO L204 MainTranslator]: Completed translation [2025-03-08 03:41:03,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03 WrapperNode [2025-03-08 03:41:03,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 03:41:03,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 03:41:03,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 03:41:03,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 03:41:03,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,506 INFO L138 Inliner]: procedures = 558, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-03-08 03:41:03,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 03:41:03,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 03:41:03,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 03:41:03,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 03:41:03,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,526 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-08 03:41:03,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 03:41:03,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 03:41:03,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 03:41:03,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 03:41:03,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (1/1) ... [2025-03-08 03:41:03,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:41:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 03:41:03,581 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-08 03:41:03,587 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-08 03:41:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 03:41:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 03:41:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 03:41:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 03:41:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 03:41:03,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 03:41:03,688 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 03:41:05,210 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-08 03:41:05,211 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 03:41:05,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 03:41:05,217 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 03:41:05,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:41:05 BoogieIcfgContainer [2025-03-08 03:41:05,217 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 03:41:05,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 03:41:05,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 03:41:05,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 03:41:05,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:41:02" (1/3) ... [2025-03-08 03:41:05,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774b333a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:41:05, skipping insertion in model container [2025-03-08 03:41:05,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:03" (2/3) ... [2025-03-08 03:41:05,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774b333a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:41:05, skipping insertion in model container [2025-03-08 03:41:05,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:41:05" (3/3) ... [2025-03-08 03:41:05,224 INFO L128 eAbstractionObserver]: Analyzing ICFG exp_3_safe.c-amalgamation.i [2025-03-08 03:41:05,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 03:41:05,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exp_3_safe.c-amalgamation.i that has 1 procedures, 11 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 03:41:05,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 03:41:05,278 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;@25bc91d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 03:41:05,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 03:41:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-08 03:41:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 03:41:05,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:41:05,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 03:41:05,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:41:05,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:41:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1211904766, now seen corresponding path program 1 times [2025-03-08 03:41:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:41:05,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494580212] [2025-03-08 03:41:05,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:41:05,299 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-08 03:41:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:41:05,301 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-08 03:41:05,302 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-08 03:41:05,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 03:41:05,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 03:41:05,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:41:05,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:41:05,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 03:41:05,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:41:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:41:05,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:41:05,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:41:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494580212] [2025-03-08 03:41:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494580212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:41:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:41:05,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 03:41:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311030814] [2025-03-08 03:41:05,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:41:05,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 03:41:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:41:05,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 03:41:05,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 03:41:05,553 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 03:41:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:41:05,564 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-03-08 03:41:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 03:41:05,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2025-03-08 03:41:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:41:05,571 INFO L225 Difference]: With dead ends: 19 [2025-03-08 03:41:05,572 INFO L226 Difference]: Without dead ends: 7 [2025-03-08 03:41:05,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-08 03:41:05,579 INFO L435 NwaCegarLoop]: 10 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, 10 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-08 03:41:05,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:41:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-08 03:41:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-08 03:41:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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-08 03:41:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2025-03-08 03:41:05,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 6 [2025-03-08 03:41:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:41:05,607 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2025-03-08 03:41:05,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 03:41:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2025-03-08 03:41:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 03:41:05,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:41:05,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 03:41:05,622 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-08 03:41:05,809 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-08 03:41:05,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:41:05,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:41:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1211934557, now seen corresponding path program 1 times [2025-03-08 03:41:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:41:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824598338] [2025-03-08 03:41:05,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:41:05,811 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-08 03:41:05,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:41:05,813 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-08 03:41:05,814 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-08 03:41:05,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 03:41:06,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 03:41:06,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:41:06,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 03:41:06,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 03:41:06,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 03:41:06,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 03:41:06,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:41:06,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 03:41:06,211 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-08 03:41:06,211 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 03:41:06,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 03:41:06,224 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-08 03:41:06,417 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-08 03:41:06,419 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 03:41:06,431 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 03:41:06,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:41:06 BoogieIcfgContainer [2025-03-08 03:41:06,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 03:41:06,435 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 03:41:06,435 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 03:41:06,436 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 03:41:06,436 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:41:05" (3/4) ... [2025-03-08 03:41:06,438 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 03:41:06,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 03:41:06,439 INFO L158 Benchmark]: Toolchain (without parser) took 3551.25ms. Allocated memory is still 83.9MB. Free memory was 57.2MB in the beginning and 49.7MB in the end (delta: 7.5MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2025-03-08 03:41:06,439 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.3MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:41:06,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.08ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 35.3MB in the end (delta: 21.6MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-03-08 03:41:06,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.65ms. Allocated memory is still 83.9MB. Free memory was 35.3MB in the beginning and 32.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:41:06,440 INFO L158 Benchmark]: Boogie Preprocessor took 47.71ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 54.8MB in the end (delta: -22.2MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2025-03-08 03:41:06,441 INFO L158 Benchmark]: IcfgBuilder took 1660.34ms. Allocated memory is still 83.9MB. Free memory was 54.8MB in the beginning and 45.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:41:06,441 INFO L158 Benchmark]: TraceAbstraction took 1215.72ms. Allocated memory is still 83.9MB. Free memory was 45.0MB in the beginning and 49.7MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:41:06,441 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 83.9MB. Free memory was 49.7MB in the beginning and 49.7MB in the end (delta: 4.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:41:06,442 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.13ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.3MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.08ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 35.3MB in the end (delta: 21.6MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.65ms. Allocated memory is still 83.9MB. Free memory was 35.3MB in the beginning and 32.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.71ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 54.8MB in the end (delta: -22.2MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * IcfgBuilder took 1660.34ms. Allocated memory is still 83.9MB. Free memory was 54.8MB in the beginning and 45.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1215.72ms. Allocated memory is still 83.9MB. Free memory was 45.0MB in the beginning and 49.7MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 83.9MB. Free memory was 49.7MB in the beginning and 49.7MB in the end (delta: 4.2kB). 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: 853]: 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 expf at line 851. Possible FailurePath: [L847] float x1 = __VERIFIER_nondet_float(); [L848] COND FALSE !(!(__builtin_isgreaterequal(x1, -88.0f) && __builtin_islessequal(x1, 88.0f))) VAL [x1=0.0] [L849] float x2 = x1 + 1e-2f; [L850] float y1 = expf(x1); [L851] float y2 = expf(x2); [L852] float derivative = (y2 - y1) / 1e-2f; VAL [derivative=-200.0, y1=2.0] [L853] COND TRUE !(__builtin_isgreaterequal(derivative, y1)) [L853] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 12 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 10 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, 10 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 26 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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-08 03:41:06,466 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: UNKNOWN: Overapproximated counterexample