./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-85.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 c7670603e0a087e73dc969b282734c8dd43456b4629350be39c8fff98720cbe1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:42:54,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:42:54,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:42:54,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:42:54,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:42:54,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:42:54,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:42:54,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:42:54,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:42:54,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:42:54,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:42:54,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:42:54,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:42:54,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:42:54,917 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:42:54,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:42:54,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:42:54,917 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:42:54,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:42:54,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:42:54,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:42:54,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:42:54,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:42:54,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:42:54,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:42:54,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:42:54,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:42:54,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:42:54,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:42:54,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:42:54,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:42:54,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:42:54,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:42:54,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:42:54,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:42:54,920 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 -> c7670603e0a087e73dc969b282734c8dd43456b4629350be39c8fff98720cbe1 [2025-03-03 18:42:55,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:42:55,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:42:55,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:42:55,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:42:55,148 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:42:55,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-85.i [2025-03-03 18:42:56,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b41ea471/d67b52a4297f4d019b61e7edeacdfdb9/FLAGd3b503bcc [2025-03-03 18:42:56,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:42:56,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-85.i [2025-03-03 18:42:56,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b41ea471/d67b52a4297f4d019b61e7edeacdfdb9/FLAGd3b503bcc [2025-03-03 18:42:56,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b41ea471/d67b52a4297f4d019b61e7edeacdfdb9 [2025-03-03 18:42:56,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:42:56,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:42:56,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:42:56,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:42:56,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:42:56,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:42:56" (1/1) ... [2025-03-03 18:42:56,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdc3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:56, skipping insertion in model container [2025-03-03 18:42:56,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:42:56" (1/1) ... [2025-03-03 18:42:56,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:42:56,971 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-85.i[919,932] [2025-03-03 18:42:57,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:42:57,013 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:42:57,021 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-85.i[919,932] [2025-03-03 18:42:57,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:42:57,054 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:42:57,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57 WrapperNode [2025-03-03 18:42:57,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:42:57,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:42:57,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:42:57,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:42:57,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,089 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-03 18:42:57,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:42:57,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:42:57,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:42:57,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:42:57,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,107 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-03 18:42:57,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:42:57,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:42:57,115 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:42:57,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:42:57,116 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (1/1) ... [2025-03-03 18:42:57,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:42:57,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:42:57,142 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-03 18:42:57,147 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-03 18:42:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:42:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:42:57,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:42:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:42:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:42:57,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:42:57,219 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:42:57,221 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:42:57,427 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:42:57,428 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:42:57,435 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:42:57,436 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:42:57,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:42:57 BoogieIcfgContainer [2025-03-03 18:42:57,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:42:57,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:42:57,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:42:57,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:42:57,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:42:56" (1/3) ... [2025-03-03 18:42:57,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2696b142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:42:57, skipping insertion in model container [2025-03-03 18:42:57,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:42:57" (2/3) ... [2025-03-03 18:42:57,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2696b142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:42:57, skipping insertion in model container [2025-03-03 18:42:57,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:42:57" (3/3) ... [2025-03-03 18:42:57,444 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-85.i [2025-03-03 18:42:57,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:42:57,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-85.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:42:57,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:42:57,504 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;@26ed638a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:42:57,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:42:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:42:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 18:42:57,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:42:57,513 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:42:57,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:42:57,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:42:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash -155615813, now seen corresponding path program 1 times [2025-03-03 18:42:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:42:57,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442395672] [2025-03-03 18:42:57,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:42:57,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:42:57,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 18:42:57,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 18:42:57,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:42:57,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:42:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 18:42:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:42:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442395672] [2025-03-03 18:42:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442395672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:42:57,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613973212] [2025-03-03 18:42:57,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:42:57,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:42:57,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:42:57,757 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-03 18:42:57,758 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-03 18:42:57,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 18:42:57,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 18:42:57,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:42:57,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:42:57,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:42:57,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:42:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 18:42:57,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:42:57,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613973212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:42:57,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:42:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:42:57,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636747972] [2025-03-03 18:42:57,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:42:57,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:42:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:42:57,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:42:57,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:42:57,926 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:42:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:42:57,943 INFO L93 Difference]: Finished difference Result 96 states and 162 transitions. [2025-03-03 18:42:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:42:57,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-03-03 18:42:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:42:57,950 INFO L225 Difference]: With dead ends: 96 [2025-03-03 18:42:57,950 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 18:42:57,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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-03 18:42:57,956 INFO L435 NwaCegarLoop]: 70 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, 70 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-03 18:42:57,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:42:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 18:42:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 18:42:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:42:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2025-03-03 18:42:57,985 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 99 [2025-03-03 18:42:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:42:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2025-03-03 18:42:57,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:42:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2025-03-03 18:42:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 18:42:57,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:42:57,990 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:42:57,996 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-03 18:42:58,194 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-03 18:42:58,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:42:58,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:42:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1431192416, now seen corresponding path program 1 times [2025-03-03 18:42:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:42:58,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097386776] [2025-03-03 18:42:58,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:42:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:42:58,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 18:42:58,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 18:42:58,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:42:58,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:42:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:42:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:42:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097386776] [2025-03-03 18:42:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097386776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:42:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:42:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:42:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697673307] [2025-03-03 18:42:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:42:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:42:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:42:58,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:42:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:42:58,708 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:42:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:42:58,890 INFO L93 Difference]: Finished difference Result 139 states and 205 transitions. [2025-03-03 18:42:58,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:42:58,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-03 18:42:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:42:58,892 INFO L225 Difference]: With dead ends: 139 [2025-03-03 18:42:58,892 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 18:42:58,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:42:58,893 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:42:58,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:42:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 18:42:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2025-03-03 18:42:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:42:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2025-03-03 18:42:58,915 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 99 [2025-03-03 18:42:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:42:58,915 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2025-03-03 18:42:58,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:42:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2025-03-03 18:42:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:42:58,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:42:58,918 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:42:58,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:42:58,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:42:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:42:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash 869954724, now seen corresponding path program 1 times [2025-03-03 18:42:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:42:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089252815] [2025-03-03 18:42:58,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:42:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:42:58,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:42:58,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:42:58,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:42:58,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:42:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:42:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:42:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089252815] [2025-03-03 18:42:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089252815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:42:59,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:42:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:42:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391452826] [2025-03-03 18:42:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:42:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:42:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:42:59,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:42:59,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:42:59,367 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:42:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:42:59,591 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2025-03-03 18:42:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:42:59,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-03-03 18:42:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:42:59,593 INFO L225 Difference]: With dead ends: 152 [2025-03-03 18:42:59,593 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 18:42:59,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:42:59,594 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 79 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:42:59,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 210 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:42:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 18:42:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2025-03-03 18:42:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:42:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2025-03-03 18:42:59,623 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 100 [2025-03-03 18:42:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:42:59,624 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2025-03-03 18:42:59,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:42:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2025-03-03 18:42:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:42:59,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:42:59,626 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:42:59,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:42:59,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:42:59,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:42:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1757458405, now seen corresponding path program 1 times [2025-03-03 18:42:59,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:42:59,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182867474] [2025-03-03 18:42:59,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:42:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:42:59,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:42:59,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:42:59,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:42:59,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:42:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:42:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:42:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182867474] [2025-03-03 18:42:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182867474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:42:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234899154] [2025-03-03 18:42:59,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:42:59,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:42:59,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:42:59,815 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-03 18:42:59,817 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-03 18:42:59,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:42:59,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:42:59,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:42:59,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:42:59,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 18:42:59,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:42:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 18:42:59,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:43:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:43:00,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234899154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:43:00,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:43:00,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-03 18:43:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159283592] [2025-03-03 18:43:00,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:43:00,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:43:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:00,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:43:00,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:43:00,161 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 18:43:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:00,422 INFO L93 Difference]: Finished difference Result 199 states and 278 transitions. [2025-03-03 18:43:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:43:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 100 [2025-03-03 18:43:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:00,427 INFO L225 Difference]: With dead ends: 199 [2025-03-03 18:43:00,427 INFO L226 Difference]: Without dead ends: 152 [2025-03-03 18:43:00,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:43:00,429 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 97 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:00,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 189 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:43:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-03 18:43:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 94. [2025-03-03 18:43:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:43:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2025-03-03 18:43:00,460 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 100 [2025-03-03 18:43:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:00,461 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2025-03-03 18:43:00,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 18:43:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2025-03-03 18:43:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:43:00,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:00,462 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:43:00,470 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-03 18:43:00,662 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-03 18:43:00,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:00,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash -49996058, now seen corresponding path program 1 times [2025-03-03 18:43:00,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009312904] [2025-03-03 18:43:00,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:00,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:43:00,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:43:00,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:43:00,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497094480] [2025-03-03 18:43:00,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:00,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:00,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:00,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:43:00,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:43:00,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:43:00,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:43:00,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:00,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:43:00,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:43:00,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:43:00,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:43:00,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:00,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:43:00,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:43:00,974 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:43:00,975 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:43:00,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:43:01,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:01,180 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 18:43:01,231 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:43:01,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:43:01 BoogieIcfgContainer [2025-03-03 18:43:01,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:43:01,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:43:01,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:43:01,237 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:43:01,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:42:57" (3/4) ... [2025-03-03 18:43:01,239 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:43:01,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:43:01,240 INFO L158 Benchmark]: Toolchain (without parser) took 4384.74ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.4MB in the beginning and 133.5MB in the end (delta: -22.1MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-03-03 18:43:01,240 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:43:01,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.09ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 97.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:43:01,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.12ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:43:01,241 INFO L158 Benchmark]: Boogie Preprocessor took 24.55ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:43:01,241 INFO L158 Benchmark]: IcfgBuilder took 321.58ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 72.5MB in the end (delta: 18.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:43:01,242 INFO L158 Benchmark]: TraceAbstraction took 3797.69ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 72.0MB in the beginning and 133.5MB in the end (delta: -61.5MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2025-03-03 18:43:01,242 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 176.2MB. Free memory was 133.5MB in the beginning and 133.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:43:01,243 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.97ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.09ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 97.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.12ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.55ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 321.58ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 72.5MB in the end (delta: 18.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3797.69ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 72.0MB in the beginning and 133.5MB in the end (delta: -61.5MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 176.2MB. Free memory was 133.5MB in the beginning and 133.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] unsigned long int last_1_var_1_1 = 1000; [L39] unsigned char last_1_var_1_5 = 1; [L40] unsigned long int last_1_var_1_12 = 128; [L41] unsigned char last_1_var_1_13 = 16; [L42] unsigned long int last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L107] last_1_var_1_1 = var_1_1 [L108] last_1_var_1_5 = var_1_5 [L109] last_1_var_1_12 = var_1_12 [L110] last_1_var_1_13 = var_1_13 [L111] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L121] RET updateLastVariables() [L122] CALL updateVariables() [L82] var_1_6 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L83] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L84] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L84] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L85] var_1_8 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L87] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L87] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L88] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L88] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L89] var_1_9 = __VERIFIER_nondet_ulong() [L90] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L90] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L91] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L91] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L92] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L92] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L93] var_1_11 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L94] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L95] var_1_14 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L96] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L97] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L97] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L98] var_1_17 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L99] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L100] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L100] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L101] var_1_19 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L102] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L103] var_1_20 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L104] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L122] RET updateVariables() [L123] CALL step() [L46] COND TRUE last_1_var_1_13 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L47] COND TRUE \read(last_1_var_1_5) [L48] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L57] COND TRUE last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1) [L58] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L62] COND FALSE !(var_1_5 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L65] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L66] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L67] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=-4294967295] [L70] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L75] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=-4294967295] [L77] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L78] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=-4294967295] [L123] RET step() [L124] CALL, EXPR property() [L114-L115] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=-4294967295] [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=-4294967295] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=254, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=-4294967295] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 649 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 253 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 4 MinimizatonAttempts, 97 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 797 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 2559 SizeOfPredicates, 4 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 2894/2940 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-03 18:43:01,261 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-85.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 c7670603e0a087e73dc969b282734c8dd43456b4629350be39c8fff98720cbe1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:43:03,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:43:03,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:43:03,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:43:03,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:43:03,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:43:03,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:43:03,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:43:03,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:43:03,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:43:03,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:43:03,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:43:03,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:43:03,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:43:03,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:43:03,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:43:03,177 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:43:03,178 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:43:03,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:43:03,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:43:03,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:43:03,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:43:03,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:43:03,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:43:03,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:43:03,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:43:03,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:43:03,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:43:03,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:43:03,180 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 -> c7670603e0a087e73dc969b282734c8dd43456b4629350be39c8fff98720cbe1 [2025-03-03 18:43:03,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:43:03,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:43:03,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:43:03,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:43:03,425 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:43:03,428 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-85.i [2025-03-03 18:43:04,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8a4f88b/80ec1fcfde5e4631ad6a433cfe37f1ae/FLAGbe68b1762 [2025-03-03 18:43:04,751 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:43:04,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-85.i [2025-03-03 18:43:04,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8a4f88b/80ec1fcfde5e4631ad6a433cfe37f1ae/FLAGbe68b1762 [2025-03-03 18:43:04,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8a4f88b/80ec1fcfde5e4631ad6a433cfe37f1ae [2025-03-03 18:43:04,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:43:04,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:43:04,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:43:04,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:43:04,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:43:04,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:43:04" (1/1) ... [2025-03-03 18:43:04,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34397b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:04, skipping insertion in model container [2025-03-03 18:43:04,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:43:04" (1/1) ... [2025-03-03 18:43:04,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:43:04,898 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-85.i[919,932] [2025-03-03 18:43:04,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:43:04,960 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:43:04,968 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-85.i[919,932] [2025-03-03 18:43:04,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:43:05,003 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:43:05,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05 WrapperNode [2025-03-03 18:43:05,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:43:05,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:43:05,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:43:05,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:43:05,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,046 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-03 18:43:05,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:43:05,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:43:05,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:43:05,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:43:05,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,073 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-03 18:43:05,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:43:05,100 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:43:05,100 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:43:05,100 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:43:05,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (1/1) ... [2025-03-03 18:43:05,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:43:05,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:05,126 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-03 18:43:05,129 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-03 18:43:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:43:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:43:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:43:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:43:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:43:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:43:05,204 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:43:05,205 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:43:08,160 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:43:08,160 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:43:08,166 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:43:08,166 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:43:08,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:43:08 BoogieIcfgContainer [2025-03-03 18:43:08,167 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:43:08,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:43:08,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:43:08,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:43:08,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:43:04" (1/3) ... [2025-03-03 18:43:08,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b86615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:43:08, skipping insertion in model container [2025-03-03 18:43:08,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:05" (2/3) ... [2025-03-03 18:43:08,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b86615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:43:08, skipping insertion in model container [2025-03-03 18:43:08,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:43:08" (3/3) ... [2025-03-03 18:43:08,173 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-85.i [2025-03-03 18:43:08,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:43:08,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-85.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:43:08,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:43:08,231 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;@6531f6b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:43:08,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:43:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:43:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 18:43:08,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:08,240 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:43:08,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -155615813, now seen corresponding path program 1 times [2025-03-03 18:43:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:43:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316856092] [2025-03-03 18:43:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:08,252 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-03 18:43:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:43:08,254 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-03 18:43:08,256 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-03 18:43:08,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 18:43:08,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 18:43:08,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:08,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:08,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:43:08,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:43:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-03 18:43:08,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:43:08,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:43:08,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316856092] [2025-03-03 18:43:08,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316856092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:43:08,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:43:08,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:43:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299174379] [2025-03-03 18:43:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:08,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:43:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:43:08,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:43:08,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:43:08,640 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:43:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:08,653 INFO L93 Difference]: Finished difference Result 96 states and 162 transitions. [2025-03-03 18:43:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:43:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-03-03 18:43:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:08,658 INFO L225 Difference]: With dead ends: 96 [2025-03-03 18:43:08,658 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 18:43:08,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-03 18:43:08,662 INFO L435 NwaCegarLoop]: 70 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, 70 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-03 18:43:08,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:43:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 18:43:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 18:43:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:43:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2025-03-03 18:43:08,685 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 99 [2025-03-03 18:43:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:08,685 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2025-03-03 18:43:08,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:43:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2025-03-03 18:43:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 18:43:08,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:08,688 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:43:08,701 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-03 18:43:08,888 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-03 18:43:08,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:08,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1431192416, now seen corresponding path program 1 times [2025-03-03 18:43:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:43:08,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021011116] [2025-03-03 18:43:08,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:08,890 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-03 18:43:08,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:43:08,892 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-03 18:43:08,893 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-03 18:43:08,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 18:43:09,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 18:43:09,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:09,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:09,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 18:43:09,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:43:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:43:09,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:43:09,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:43:09,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021011116] [2025-03-03 18:43:09,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021011116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:43:09,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:43:09,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:43:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357450141] [2025-03-03 18:43:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:09,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:43:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:43:09,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:43:09,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:43:09,685 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:11,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 18:43:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:11,218 INFO L93 Difference]: Finished difference Result 93 states and 137 transitions. [2025-03-03 18:43:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:43:11,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-03 18:43:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:11,244 INFO L225 Difference]: With dead ends: 93 [2025-03-03 18:43:11,244 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 18:43:11,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:43:11,245 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:11,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 63 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 18:43:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 18:43:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 18:43:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:43:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-03 18:43:11,251 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 99 [2025-03-03 18:43:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:11,252 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-03 18:43:11,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-03 18:43:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:43:11,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:11,254 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:43:11,266 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-03 18:43:11,455 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-03 18:43:11,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:11,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash 869954724, now seen corresponding path program 1 times [2025-03-03 18:43:11,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:43:11,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644152657] [2025-03-03 18:43:11,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:11,456 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-03 18:43:11,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:43:11,459 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-03 18:43:11,461 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-03 18:43:11,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:43:11,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:43:11,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:11,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:11,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 18:43:11,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:43:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 18:43:12,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:43:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:43:13,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:43:13,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644152657] [2025-03-03 18:43:13,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644152657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:43:13,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:43:13,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2025-03-03 18:43:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165133013] [2025-03-03 18:43:13,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:43:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:43:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:43:13,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:43:13,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:43:13,457 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 18:43:18,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 18:43:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:18,885 INFO L93 Difference]: Finished difference Result 212 states and 304 transitions. [2025-03-03 18:43:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 18:43:18,886 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 100 [2025-03-03 18:43:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:18,887 INFO L225 Difference]: With dead ends: 212 [2025-03-03 18:43:18,887 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 18:43:18,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:43:18,889 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 241 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:18,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 398 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 18:43:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 18:43:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 119. [2025-03-03 18:43:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 18:43:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-03-03 18:43:18,922 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 100 [2025-03-03 18:43:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:18,923 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-03-03 18:43:18,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 18:43:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-03-03 18:43:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:43:18,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:18,925 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:43:18,939 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-03 18:43:19,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:43:19,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:19,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash -49996058, now seen corresponding path program 1 times [2025-03-03 18:43:19,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:43:19,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086295028] [2025-03-03 18:43:19,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:19,127 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-03 18:43:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:43:19,129 INFO L229 MonitoredProcess]: Starting monitored process 5 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-03 18:43:19,129 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 (5)] Waiting until timeout for monitored process [2025-03-03 18:43:19,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:43:19,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:43:19,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:19,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:19,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 18:43:19,389 INFO L279 TraceCheckSpWp]: Computing forward predicates...