./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-1.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 8438813f75b73dcf2098d7bba02b669fce890ad3c07d06b371f40dc8ed310161 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:44:55,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:44:55,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:44:55,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:44:55,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:44:55,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:44:55,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:44:55,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:44:55,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:44:55,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:44:55,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:44:55,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:44:55,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:44:55,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:44:55,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:44:55,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:44:55,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:55,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:44:55,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:44:55,859 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 -> 8438813f75b73dcf2098d7bba02b669fce890ad3c07d06b371f40dc8ed310161 [2025-03-08 09:44:56,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:44:56,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:44:56,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:44:56,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:44:56,093 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:44:56,094 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-1.i [2025-03-08 09:44:57,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22efdb1a/960635052acd4c97ab26d2befa8dcbd5/FLAGde082c6ff [2025-03-08 09:44:57,509 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:44:57,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-1.i [2025-03-08 09:44:57,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22efdb1a/960635052acd4c97ab26d2befa8dcbd5/FLAGde082c6ff [2025-03-08 09:44:57,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22efdb1a/960635052acd4c97ab26d2befa8dcbd5 [2025-03-08 09:44:57,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:44:57,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:44:57,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:57,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:44:57,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:44:57,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:57,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57, skipping insertion in model container [2025-03-08 09:44:57,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:57,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:44:57,913 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-1.i[918,931] [2025-03-08 09:44:57,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:57,982 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:44:57,991 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-1.i[918,931] [2025-03-08 09:44:58,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:58,035 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:44:58,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58 WrapperNode [2025-03-08 09:44:58,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:58,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:58,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:44:58,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:44:58,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,084 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-03-08 09:44:58,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:58,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:44:58,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:44:58,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:44:58,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,119 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-08 09:44:58,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:44:58,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:44:58,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:44:58,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:44:58,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (1/1) ... [2025-03-08 09:44:58,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:58,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:44:58,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:44:58,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:44:58,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:44:58,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:44:58,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:44:58,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:44:58,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:44:58,248 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:44:58,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:44:58,511 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:44:58,512 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:44:58,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:44:58,518 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:44:58,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:58 BoogieIcfgContainer [2025-03-08 09:44:58,519 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:44:58,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:44:58,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:44:58,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:44:58,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:44:57" (1/3) ... [2025-03-08 09:44:58,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476e3b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:44:58, skipping insertion in model container [2025-03-08 09:44:58,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:58" (2/3) ... [2025-03-08 09:44:58,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476e3b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:44:58, skipping insertion in model container [2025-03-08 09:44:58,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:58" (3/3) ... [2025-03-08 09:44:58,525 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-1.i [2025-03-08 09:44:58,534 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:44:58,536 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-1.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:44:58,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:44:58,583 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;@43884711, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:44:58,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:44:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 09:44:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:44:58,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:58,595 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:44:58,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:58,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash 550985561, now seen corresponding path program 1 times [2025-03-08 09:44:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:58,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360851414] [2025-03-08 09:44:58,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:58,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:44:58,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:44:58,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:58,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 09:44:58,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:58,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360851414] [2025-03-08 09:44:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360851414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:44:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103184797] [2025-03-08 09:44:58,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:58,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:44:58,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:58,803 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-08 09:44:58,805 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-08 09:44:58,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:44:58,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:44:58,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:58,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:58,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:44:58,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:44:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 09:44:58,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:44:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103184797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:44:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:44:58,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541127614] [2025-03-08 09:44:58,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:58,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:44:58,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:58,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:44:58,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:44:58,982 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:44:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:58,998 INFO L93 Difference]: Finished difference Result 122 states and 214 transitions. [2025-03-08 09:44:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:44:59,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 09:44:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:59,006 INFO L225 Difference]: With dead ends: 122 [2025-03-08 09:44:59,007 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 09:44:59,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:44:59,011 INFO L435 NwaCegarLoop]: 91 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, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:59,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:44:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 09:44:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 09:44:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 09:44:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2025-03-08 09:44:59,042 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 143 [2025-03-08 09:44:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:59,043 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2025-03-08 09:44:59,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:44:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2025-03-08 09:44:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:44:59,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:59,045 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:44:59,052 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-08 09:44:59,248 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-08 09:44:59,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:59,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1862789576, now seen corresponding path program 1 times [2025-03-08 09:44:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087772142] [2025-03-08 09:44:59,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:59,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:44:59,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:44:59,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:59,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 09:44:59,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087772142] [2025-03-08 09:44:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087772142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:59,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:59,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:44:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060770631] [2025-03-08 09:44:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:44:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:59,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:44:59,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:44:59,680 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 09:44:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:59,716 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2025-03-08 09:44:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:44:59,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-03-08 09:44:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:59,721 INFO L225 Difference]: With dead ends: 177 [2025-03-08 09:44:59,723 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 09:44:59,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:44:59,725 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 42 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:59,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:44:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 09:44:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2025-03-08 09:44:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 09:44:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 177 transitions. [2025-03-08 09:44:59,748 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 177 transitions. Word has length 143 [2025-03-08 09:44:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:59,749 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 177 transitions. [2025-03-08 09:44:59,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 09:44:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2025-03-08 09:44:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 09:44:59,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:59,753 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:44:59,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:44:59,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:59,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1611063273, now seen corresponding path program 1 times [2025-03-08 09:44:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:59,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632598530] [2025-03-08 09:44:59,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:59,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:44:59,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:44:59,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:59,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 09:44:59,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:59,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632598530] [2025-03-08 09:44:59,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632598530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:59,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:59,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:59,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569583375] [2025-03-08 09:44:59,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:59,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:59,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:59,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:59,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:59,971 INFO L87 Difference]: Start difference. First operand 117 states and 177 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:45:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:00,322 INFO L93 Difference]: Finished difference Result 290 states and 426 transitions. [2025-03-08 09:45:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:45:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-03-08 09:45:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:00,326 INFO L225 Difference]: With dead ends: 290 [2025-03-08 09:45:00,326 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 09:45:00,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:45:00,328 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 174 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:00,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 162 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:45:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 09:45:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 125. [2025-03-08 09:45:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 09:45:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2025-03-08 09:45:00,362 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 144 [2025-03-08 09:45:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:00,363 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2025-03-08 09:45:00,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:45:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2025-03-08 09:45:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 09:45:00,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:00,364 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:45:00,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:45:00,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:00,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1824105972, now seen corresponding path program 1 times [2025-03-08 09:45:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129006] [2025-03-08 09:45:00,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:00,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:45:00,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:45:00,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:00,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 09:45:00,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878010309] [2025-03-08 09:45:00,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:00,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:00,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:00,450 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-08 09:45:00,451 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-08 09:45:00,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:45:00,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:45:00,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:00,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:45:00,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:45:00,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:45:00,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:45:00,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:00,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:45:00,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:45:00,627 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:45:00,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:45:00,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 09:45:00,830 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,SelfDestructingSolverStorable3 [2025-03-08 09:45:00,832 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 09:45:00,917 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:45:00,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:45:00 BoogieIcfgContainer [2025-03-08 09:45:00,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:45:00,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:45:00,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:45:00,920 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:45:00,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:58" (3/4) ... [2025-03-08 09:45:00,922 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:45:00,923 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:45:00,923 INFO L158 Benchmark]: Toolchain (without parser) took 3122.45ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.5MB in the beginning and 264.0MB in the end (delta: -158.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:00,923 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:00,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.21ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 91.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:45:00,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.11ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:00,924 INFO L158 Benchmark]: Boogie Preprocessor took 56.75ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 85.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:00,924 INFO L158 Benchmark]: IcfgBuilder took 375.67ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 65.1MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:45:00,924 INFO L158 Benchmark]: TraceAbstraction took 2399.48ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 64.4MB in the beginning and 264.0MB in the end (delta: -199.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2025-03-08 09:45:00,924 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 302.0MB. Free memory was 264.0MB in the beginning and 264.0MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:00,925 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.88ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.21ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 91.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.11ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.75ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 85.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 375.67ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 65.1MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2399.48ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 64.4MB in the beginning and 264.0MB in the end (delta: -199.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 302.0MB. Free memory was 264.0MB in the beginning and 264.0MB in the end (delta: 27.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 91, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2, var_1_9=4000000001/4] [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] FCALL updateLastVariables() [L136] CALL updateVariables() [L88] var_1_9 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L90] var_1_11 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L91] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L92] var_1_13 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L93] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L94] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L94] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L95] var_1_14 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L96] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L97] var_1_16 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L98] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L99] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L99] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L100] var_1_17 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L101] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L102] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L102] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L103] var_1_19 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L104] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L105] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L105] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L106] var_1_20 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L107] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L108] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L108] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L109] var_1_21 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L110] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L111] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L111] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L112] var_1_22 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L113] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L114] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L114] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L115] var_1_24 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L116] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L117] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L117] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L118] var_1_25 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L119] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L120] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L120] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L121] var_1_26 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L122] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L123] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L123] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L136] RET updateVariables() [L137] CALL step() [L46] var_1_15 = (var_1_16 - var_1_17) [L47] var_1_27 = var_1_21 VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L48] COND TRUE (var_1_27 + var_1_27) <= var_1_27 [L49] var_1_1 = (128 + var_1_27) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L57] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L60] COND FALSE !(var_1_27 > var_1_27) [L63] var_1_10 = 9.75f VAL [isInitial=1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L65] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L66] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L68] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L77] COND FALSE !(var_1_23 && (var_1_18 >= var_1_27)) VAL [isInitial=1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L80] COND TRUE 1 >= var_1_27 [L81] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L137] RET step() [L138] CALL, EXPR property() [L128-L129] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 121 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 300 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 109 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 569 ConstructedInterpolants, 0 QuantifiedInterpolants, 1083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 4004/4048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:45:00,941 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-1.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 8438813f75b73dcf2098d7bba02b669fce890ad3c07d06b371f40dc8ed310161 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:45:02,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:45:02,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:45:02,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:45:02,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:45:02,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:45:02,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:45:02,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:45:02,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:45:02,878 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:45:02,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:45:02,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:45:02,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:45:02,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:45:02,879 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:45:02,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:45:02,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:45:02,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:45:02,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:45:02,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:45:02,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:45:02,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:45:02,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:45:02,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:45:02,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:45:02,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:45:02,881 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 -> 8438813f75b73dcf2098d7bba02b669fce890ad3c07d06b371f40dc8ed310161 [2025-03-08 09:45:03,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:45:03,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:45:03,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:45:03,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:45:03,148 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:45:03,149 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-1.i [2025-03-08 09:45:04,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d486c993a/c2f296a2ad414d0c91e949f5965fd9fc/FLAGa5ce0a7af [2025-03-08 09:45:04,475 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:45:04,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-1.i [2025-03-08 09:45:04,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d486c993a/c2f296a2ad414d0c91e949f5965fd9fc/FLAGa5ce0a7af [2025-03-08 09:45:04,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d486c993a/c2f296a2ad414d0c91e949f5965fd9fc [2025-03-08 09:45:04,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:45:04,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:45:04,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:45:04,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:45:04,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:45:04,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e1dc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04, skipping insertion in model container [2025-03-08 09:45:04,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:45:04,624 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-1.i[918,931] [2025-03-08 09:45:04,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:45:04,693 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:45:04,704 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-1.i[918,931] [2025-03-08 09:45:04,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:45:04,748 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:45:04,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04 WrapperNode [2025-03-08 09:45:04,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:45:04,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:45:04,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:45:04,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:45:04,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,784 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-08 09:45:04,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:45:04,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:45:04,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:45:04,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:45:04,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,803 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-08 09:45:04,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,809 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:45:04,817 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:45:04,817 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:45:04,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:45:04,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (1/1) ... [2025-03-08 09:45:04,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:45:04,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:04,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:45:04,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:45:04,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:45:04,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:45:04,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:45:04,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:45:04,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:45:04,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:45:04,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:45:04,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:45:05,179 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:45:05,179 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:45:05,186 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:45:05,186 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:45:05,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:45:05 BoogieIcfgContainer [2025-03-08 09:45:05,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:45:05,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:45:05,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:45:05,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:45:05,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:45:04" (1/3) ... [2025-03-08 09:45:05,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3dae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:45:05, skipping insertion in model container [2025-03-08 09:45:05,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:04" (2/3) ... [2025-03-08 09:45:05,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3dae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:45:05, skipping insertion in model container [2025-03-08 09:45:05,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:45:05" (3/3) ... [2025-03-08 09:45:05,196 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-1.i [2025-03-08 09:45:05,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:45:05,222 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-1.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:45:05,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:45:05,270 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;@2ebfa1f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:45:05,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:45:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 09:45:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:45:05,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:05,284 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:45:05,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash 550985561, now seen corresponding path program 1 times [2025-03-08 09:45:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:45:05,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107525243] [2025-03-08 09:45:05,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:05,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:45:05,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:45:05,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:45:05,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 09:45:05,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:45:05,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:45:05,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:05,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:05,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:45:05,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-08 09:45:05,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:45:05,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:45:05,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107525243] [2025-03-08 09:45:05,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107525243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:45:05,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:45:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:45:05,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609350689] [2025-03-08 09:45:05,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:45:05,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:45:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:45:05,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:45:05,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:45:05,556 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:45:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:05,577 INFO L93 Difference]: Finished difference Result 122 states and 214 transitions. [2025-03-08 09:45:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:45:05,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 09:45:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:05,583 INFO L225 Difference]: With dead ends: 122 [2025-03-08 09:45:05,583 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 09:45:05,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:45:05,586 INFO L435 NwaCegarLoop]: 91 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, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:05,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:45:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 09:45:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 09:45:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 09:45:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2025-03-08 09:45:05,616 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 143 [2025-03-08 09:45:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:05,616 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2025-03-08 09:45:05,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:45:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2025-03-08 09:45:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:45:05,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:05,622 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:45:05,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 09:45:05,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:45:05,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:05,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1862789576, now seen corresponding path program 1 times [2025-03-08 09:45:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:45:05,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319696009] [2025-03-08 09:45:05,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:05,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:45:05,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:45:05,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:45:05,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 09:45:05,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:45:05,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:45:05,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:05,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:05,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 09:45:05,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 09:45:06,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:45:06,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:45:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319696009] [2025-03-08 09:45:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319696009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:45:06,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:45:06,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:45:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866848067] [2025-03-08 09:45:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:45:06,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:45:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:45:06,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:45:06,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:45:06,233 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 09:45:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:06,259 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2025-03-08 09:45:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:45:06,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-03-08 09:45:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:06,264 INFO L225 Difference]: With dead ends: 177 [2025-03-08 09:45:06,264 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 09:45:06,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:45:06,265 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:06,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:45:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 09:45:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2025-03-08 09:45:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 09:45:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 177 transitions. [2025-03-08 09:45:06,293 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 177 transitions. Word has length 143 [2025-03-08 09:45:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 177 transitions. [2025-03-08 09:45:06,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 09:45:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2025-03-08 09:45:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 09:45:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:06,295 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:45:06,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 09:45:06,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:45:06,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1611063273, now seen corresponding path program 1 times [2025-03-08 09:45:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:45:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394687787] [2025-03-08 09:45:06,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:06,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:45:06,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:45:06,499 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-08 09:45:06,499 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-08 09:45:06,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:45:06,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:45:06,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:06,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:06,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 09:45:06,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 516 proven. 27 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-08 09:45:06,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:45:06,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:45:06,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394687787] [2025-03-08 09:45:06,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394687787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:45:06,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [753463612] [2025-03-08 09:45:06,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:06,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 09:45:06,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 09:45:06,793 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 09:45:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 09:45:06,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:45:07,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:45:07,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:07,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:07,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 09:45:07,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 09:45:07,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:45:07,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [753463612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:45:07,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:45:07,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 09:45:07,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270391798] [2025-03-08 09:45:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:45:07,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:45:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:45:07,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:45:07,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:45:07,321 INFO L87 Difference]: Start difference. First operand 117 states and 177 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 09:45:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:08,088 INFO L93 Difference]: Finished difference Result 342 states and 509 transitions. [2025-03-08 09:45:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:45:08,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-03-08 09:45:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:08,092 INFO L225 Difference]: With dead ends: 342 [2025-03-08 09:45:08,095 INFO L226 Difference]: Without dead ends: 228 [2025-03-08 09:45:08,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:45:08,097 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 111 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:08,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 260 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 09:45:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-08 09:45:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 163. [2025-03-08 09:45:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 99 states have (on average 1.202020202020202) internal successors, (119), 100 states have internal predecessors, (119), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 09:45:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2025-03-08 09:45:08,131 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 144 [2025-03-08 09:45:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:08,132 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2025-03-08 09:45:08,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 09:45:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2025-03-08 09:45:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 09:45:08,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:08,136 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:45:08,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 09:45:08,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2025-03-08 09:45:08,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 09:45:08,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:08,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1824105972, now seen corresponding path program 1 times [2025-03-08 09:45:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:45:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97966136] [2025-03-08 09:45:08,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:08,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:45:08,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:45:08,541 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:45:08,542 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 (6)] Waiting until timeout for monitored process [2025-03-08 09:45:08,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:45:08,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:45:08,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:08,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:08,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 09:45:08,691 INFO L279 TraceCheckSpWp]: Computing forward predicates...