./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_codestructure_dependencies_file-54.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 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:56:54,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:56:54,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:56:54,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:56:54,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:56:54,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:56:54,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:56:54,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:56:54,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:56:54,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:56:54,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:56:54,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:56:54,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:56:54,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:56:54,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:56:54,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:56:54,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:56:54,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:56:54,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:56:54,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:56:54,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:56:54,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:56:54,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:56:54,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:56:54,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:56:54,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:56:54,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:56:54,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:56:54,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:56:54,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:56:54,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:56:54,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:56:54,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:56:54,666 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 -> 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 [2025-03-16 22:56:54,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:56:54,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:56:54,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:56:54,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:56:54,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:56:54,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2025-03-16 22:56:55,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e946eb3/07b73d0bcb0047b5a1400cdf90e5bec5/FLAG9fc1263d9 [2025-03-16 22:56:56,202 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:56:56,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2025-03-16 22:56:56,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e946eb3/07b73d0bcb0047b5a1400cdf90e5bec5/FLAG9fc1263d9 [2025-03-16 22:56:56,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e946eb3/07b73d0bcb0047b5a1400cdf90e5bec5 [2025-03-16 22:56:56,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:56:56,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:56:56,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:56:56,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:56:56,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:56:56,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be06abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56, skipping insertion in model container [2025-03-16 22:56:56,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:56:56,665 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_codestructure_dependencies_file-54.i[919,932] [2025-03-16 22:56:56,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:56:56,730 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:56:56,737 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_codestructure_dependencies_file-54.i[919,932] [2025-03-16 22:56:56,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:56:56,780 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:56:56,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56 WrapperNode [2025-03-16 22:56:56,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:56:56,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:56:56,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:56:56,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:56:56,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,816 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-16 22:56:56,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:56:56,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:56:56,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:56:56,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:56:56,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,845 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-16 22:56:56,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:56:56,860 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:56:56,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:56:56,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:56:56,861 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (1/1) ... [2025-03-16 22:56:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:56:56,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:56,892 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-16 22:56:56,897 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-16 22:56:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:56:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:56:56,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:56:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:56:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:56:56,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:56:56,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:56:56,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:56:57,136 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:56:57,136 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:56:57,143 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:56:57,144 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:56:57,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:57 BoogieIcfgContainer [2025-03-16 22:56:57,145 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:56:57,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:56:57,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:56:57,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:56:57,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:56:56" (1/3) ... [2025-03-16 22:56:57,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11893d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:56:57, skipping insertion in model container [2025-03-16 22:56:57,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:56" (2/3) ... [2025-03-16 22:56:57,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11893d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:56:57, skipping insertion in model container [2025-03-16 22:56:57,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:57" (3/3) ... [2025-03-16 22:56:57,153 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-54.i [2025-03-16 22:56:57,163 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:56:57,164 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-54.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:56:57,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:56:57,217 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;@1d46d9df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:56:57,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:56:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 22:56:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 22:56:57,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:57,230 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:56:57,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:57,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash -158168072, now seen corresponding path program 1 times [2025-03-16 22:56:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:57,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207746272] [2025-03-16 22:56:57,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:57,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 22:56:57,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 22:56:57,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:57,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 22:56:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207746272] [2025-03-16 22:56:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207746272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:56:57,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120194902] [2025-03-16 22:56:57,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:57,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:57,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:57,476 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-16 22:56:57,478 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-16 22:56:57,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 22:56:57,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 22:56:57,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:57,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:57,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:56:57,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:56:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 22:56:57,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:56:57,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120194902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:57,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:56:57,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:56:57,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242316048] [2025-03-16 22:56:57,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:57,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:56:57,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:57,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:56:57,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:56:57,693 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 22:56:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:57,711 INFO L93 Difference]: Finished difference Result 107 states and 189 transitions. [2025-03-16 22:56:57,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:56:57,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2025-03-16 22:56:57,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:57,717 INFO L225 Difference]: With dead ends: 107 [2025-03-16 22:56:57,717 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 22:56:57,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-16 22:56:57,721 INFO L435 NwaCegarLoop]: 81 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, 81 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-16 22:56:57,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:56:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 22:56:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-16 22:56:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 22:56:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2025-03-16 22:56:57,752 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 129 [2025-03-16 22:56:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:57,752 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2025-03-16 22:56:57,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 22:56:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2025-03-16 22:56:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 22:56:57,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:57,759 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:56:57,767 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-16 22:56:57,959 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-16 22:56:57,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:57,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1105033401, now seen corresponding path program 1 times [2025-03-16 22:56:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:57,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533918945] [2025-03-16 22:56:57,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:57,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 22:56:58,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 22:56:58,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:58,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 22:56:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533918945] [2025-03-16 22:56:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533918945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:56:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:56:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678714229] [2025-03-16 22:56:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:58,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:56:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:58,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:56:58,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:56:58,316 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 22:56:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:58,473 INFO L93 Difference]: Finished difference Result 158 states and 242 transitions. [2025-03-16 22:56:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:56:58,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2025-03-16 22:56:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:58,476 INFO L225 Difference]: With dead ends: 158 [2025-03-16 22:56:58,476 INFO L226 Difference]: Without dead ends: 106 [2025-03-16 22:56:58,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:56:58,478 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:58,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 230 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:56:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-16 22:56:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2025-03-16 22:56:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 22:56:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2025-03-16 22:56:58,503 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 129 [2025-03-16 22:56:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:58,503 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2025-03-16 22:56:58,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 22:56:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2025-03-16 22:56:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 22:56:58,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:58,505 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:56:58,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:56:58,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:58,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash 595293129, now seen corresponding path program 1 times [2025-03-16 22:56:58,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:58,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583183948] [2025-03-16 22:56:58,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:58,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:58,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 22:56:58,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 22:56:58,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:58,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:56:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728922878] [2025-03-16 22:56:58,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:58,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:58,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:58,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:56:58,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:56:58,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 22:56:59,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 22:56:59,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:59,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:56:59,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:56:59,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 22:56:59,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 22:56:59,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:59,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:56:59,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:56:59,444 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:56:59,445 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:56:59,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:56:59,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 22:56:59,649 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 22:56:59,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:56:59,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:56:59 BoogieIcfgContainer [2025-03-16 22:56:59,730 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:56:59,731 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:56:59,731 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:56:59,731 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:56:59,732 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:57" (3/4) ... [2025-03-16 22:56:59,733 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:56:59,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:56:59,735 INFO L158 Benchmark]: Toolchain (without parser) took 3188.86ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 51.7MB in the end (delta: 61.4MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2025-03-16 22:56:59,735 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:56:59,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.18ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 99.6MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:56:59,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.58ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:56:59,736 INFO L158 Benchmark]: Boogie Preprocessor took 39.64ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:56:59,736 INFO L158 Benchmark]: IcfgBuilder took 284.40ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 76.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:56:59,737 INFO L158 Benchmark]: TraceAbstraction took 2582.98ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 51.7MB in the end (delta: 24.2MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-03-16 22:56:59,737 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 142.6MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:56:59,738 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.18ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 99.6MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.58ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.64ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 284.40ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 76.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2582.98ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 51.7MB in the end (delta: 24.2MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 142.6MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] unsigned char last_1_var_1_9 = 1; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_9 = var_1_9 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L84] var_1_5 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L85] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L86] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L86] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L87] var_1_8 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L88] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L89] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L90] var_1_10 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L92] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L93] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L94] var_1_11 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L95] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L96] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L97] var_1_12 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L98] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L99] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L101] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L102] var_1_16 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L103] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L104] var_1_17 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L105] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L106] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L107] var_1_19 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L108] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L109] var_1_20 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L110] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L111] var_1_21 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L112] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L113] var_1_22 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L114] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L128] RET updateVariables() [L129] CALL step() [L45] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=2, var_1_9=1] [L46] COND TRUE var_1_5 == var_1_4 [L47] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=-2, var_1_8=2, var_1_9=1] [L54] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L61] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=-2, var_1_8=2, var_1_9=1] [L63] COND TRUE var_1_18 > var_1_18 [L64] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-12884901901, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-2, var_1_8=2, var_1_9=1] [L68] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L69] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-12884901903, var_1_17=-12884901901, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-2, var_1_8=2, var_1_9=1] [L71] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5))) [L72] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-12884901903, var_1_17=-12884901901, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-2, var_1_8=2, var_1_9=1] [L74] COND TRUE ((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14 [L75] var_1_9 = ((! var_1_11) || var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-12884901903, var_1_17=-12884901901, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-2, var_1_8=2, var_1_9=0] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-12884901903, var_1_17=-12884901901, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-2, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-12884901903, var_1_17=-12884901901, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-2, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 106 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 159 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 304 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/2520 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-16 22:56:59,756 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_codestructure_dependencies_file-54.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 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:57:01,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:57:01,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 22:57:01,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:57:01,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:57:01,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:57:01,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:57:01,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:57:01,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:57:01,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:57:01,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:57:01,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:57:01,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:57:01,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:57:01,686 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:57:01,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:57:01,687 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:57:01,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:57:01,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:57:01,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:57:01,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:57:01,689 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:57:01,689 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:57:01,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:57:01,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:57:01,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:57:01,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:57:01,689 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 -> 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 [2025-03-16 22:57:01,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:57:01,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:57:01,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:57:01,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:57:01,928 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:57:01,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2025-03-16 22:57:03,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6bd12cb9/f78d9a2acb184d70b95ea7b65171120c/FLAG3971039f4 [2025-03-16 22:57:03,281 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:57:03,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2025-03-16 22:57:03,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6bd12cb9/f78d9a2acb184d70b95ea7b65171120c/FLAG3971039f4 [2025-03-16 22:57:03,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6bd12cb9/f78d9a2acb184d70b95ea7b65171120c [2025-03-16 22:57:03,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:57:03,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:57:03,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:57:03,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:57:03,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:57:03,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84ed2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03, skipping insertion in model container [2025-03-16 22:57:03,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:57:03,438 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_codestructure_dependencies_file-54.i[919,932] [2025-03-16 22:57:03,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:57:03,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:57:03,498 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_codestructure_dependencies_file-54.i[919,932] [2025-03-16 22:57:03,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:57:03,530 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:57:03,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03 WrapperNode [2025-03-16 22:57:03,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:57:03,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:57:03,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:57:03,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:57:03,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,573 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2025-03-16 22:57:03,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:57:03,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:57:03,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:57:03,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:57:03,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,598 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-16 22:57:03,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:57:03,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:57:03,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:57:03,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:57:03,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (1/1) ... [2025-03-16 22:57:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:57:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:57:03,657 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-16 22:57:03,662 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-16 22:57:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:57:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:57:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:57:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:57:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:57:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:57:03,743 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:57:03,745 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:57:07,756 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:57:07,757 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:57:07,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:57:07,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:57:07,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:57:07 BoogieIcfgContainer [2025-03-16 22:57:07,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:57:07,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:57:07,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:57:07,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:57:07,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:57:03" (1/3) ... [2025-03-16 22:57:07,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62eb1bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:57:07, skipping insertion in model container [2025-03-16 22:57:07,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:57:03" (2/3) ... [2025-03-16 22:57:07,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62eb1bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:57:07, skipping insertion in model container [2025-03-16 22:57:07,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:57:07" (3/3) ... [2025-03-16 22:57:07,773 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-54.i [2025-03-16 22:57:07,799 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:57:07,801 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-54.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:57:07,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:57:07,844 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;@7f51c294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:57:07,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:57:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 22:57:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 22:57:07,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:57:07,855 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:57:07,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:57:07,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:57:07,859 INFO L85 PathProgramCache]: Analyzing trace with hash -158168072, now seen corresponding path program 1 times [2025-03-16 22:57:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:57:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665070227] [2025-03-16 22:57:07,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:57:07,866 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-16 22:57:07,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:57:07,869 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-16 22:57:07,869 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-16 22:57:07,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 22:57:08,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 22:57:08,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:57:08,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:57:08,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:57:08,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:57:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-16 22:57:08,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:57:08,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:57:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665070227] [2025-03-16 22:57:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665070227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:57:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:57:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 22:57:08,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994656878] [2025-03-16 22:57:08,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:57:08,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:57:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:57:08,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:57:08,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:57:08,182 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 22:57:08,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:57:08,205 INFO L93 Difference]: Finished difference Result 107 states and 189 transitions. [2025-03-16 22:57:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:57:08,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2025-03-16 22:57:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:57:08,212 INFO L225 Difference]: With dead ends: 107 [2025-03-16 22:57:08,212 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 22:57:08,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-16 22:57:08,217 INFO L435 NwaCegarLoop]: 80 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, 80 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-16 22:57:08,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:57:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 22:57:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-16 22:57:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 22:57:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions. [2025-03-16 22:57:08,254 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 129 [2025-03-16 22:57:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:57:08,255 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 80 transitions. [2025-03-16 22:57:08,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 22:57:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2025-03-16 22:57:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 22:57:08,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:57:08,258 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:57:08,271 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-16 22:57:08,458 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-16 22:57:08,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:57:08,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:57:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1992537082, now seen corresponding path program 1 times [2025-03-16 22:57:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:57:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632679447] [2025-03-16 22:57:08,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:57:08,460 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-16 22:57:08,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:57:08,462 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-16 22:57:08,464 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-16 22:57:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 22:57:08,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 22:57:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:57:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:57:08,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 22:57:08,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:57:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 22:57:09,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:57:09,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:57:09,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632679447] [2025-03-16 22:57:09,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632679447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:57:09,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:57:09,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:57:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272221681] [2025-03-16 22:57:09,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:57:09,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:57:09,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:57:09,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:57:09,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:57:09,330 INFO L87 Difference]: Start difference. First operand 53 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 22:57:13,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:57:15,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:57:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:57:15,303 INFO L93 Difference]: Finished difference Result 158 states and 239 transitions. [2025-03-16 22:57:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:57:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2025-03-16 22:57:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:57:15,333 INFO L225 Difference]: With dead ends: 158 [2025-03-16 22:57:15,333 INFO L226 Difference]: Without dead ends: 106 [2025-03-16 22:57:15,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:57:15,334 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:57:15,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 227 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-16 22:57:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-16 22:57:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2025-03-16 22:57:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 22:57:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2025-03-16 22:57:15,353 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 129 [2025-03-16 22:57:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:57:15,355 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2025-03-16 22:57:15,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 22:57:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2025-03-16 22:57:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 22:57:15,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:57:15,357 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:57:15,367 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-16 22:57:15,558 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-16 22:57:15,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:57:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:57:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1482796810, now seen corresponding path program 1 times [2025-03-16 22:57:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:57:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842194894] [2025-03-16 22:57:15,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:57:15,559 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-16 22:57:15,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:57:15,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 22:57:15,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 22:57:15,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 22:57:15,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 22:57:15,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:57:15,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:57:15,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 22:57:15,904 INFO L279 TraceCheckSpWp]: Computing forward predicates...