./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.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_fillercode_fillercodesize_normal_file-96.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 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:20:18,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:20:18,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:20:18,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:20:18,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:20:18,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:20:18,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:20:18,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:20:18,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:20:18,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:20:18,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:20:18,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:20:18,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:20:18,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:20:18,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:20:18,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:20:18,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:20:18,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:20:18,923 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 -> 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 [2025-03-03 19:20:19,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:20:19,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:20:19,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:20:19,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:20:19,159 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:20:19,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i [2025-03-03 19:20:20,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a512daf/d804aa5e81a0482a998eff790b6471f6/FLAGdd20f3b94 [2025-03-03 19:20:20,557 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:20:20,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i [2025-03-03 19:20:20,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a512daf/d804aa5e81a0482a998eff790b6471f6/FLAGdd20f3b94 [2025-03-03 19:20:20,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a512daf/d804aa5e81a0482a998eff790b6471f6 [2025-03-03 19:20:20,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:20:20,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:20:20,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:20:20,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:20:20,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:20:20,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ff894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20, skipping insertion in model container [2025-03-03 19:20:20,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:20:20,715 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_fillercode_fillercodesize_normal_file-96.i[913,926] [2025-03-03 19:20:20,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:20:20,764 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:20:20,772 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_fillercode_fillercodesize_normal_file-96.i[913,926] [2025-03-03 19:20:20,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:20:20,804 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:20:20,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20 WrapperNode [2025-03-03 19:20:20,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:20:20,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:20:20,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:20:20,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:20:20,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,844 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-03-03 19:20:20,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:20:20,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:20:20,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:20:20,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:20:20,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,876 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 19:20:20,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:20:20,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:20:20,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:20:20,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:20:20,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (1/1) ... [2025-03-03 19:20:20,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:20:20,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:20:20,916 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 19:20:20,920 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 19:20:20,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:20:20,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:20:20,937 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:20:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:20:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:20:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:20:21,000 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:20:21,002 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:20:21,224 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 19:20:21,224 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:20:21,233 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:20:21,233 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:20:21,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:21 BoogieIcfgContainer [2025-03-03 19:20:21,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:20:21,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:20:21,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:20:21,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:20:21,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:20:20" (1/3) ... [2025-03-03 19:20:21,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4847a810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:20:21, skipping insertion in model container [2025-03-03 19:20:21,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:20" (2/3) ... [2025-03-03 19:20:21,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4847a810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:20:21, skipping insertion in model container [2025-03-03 19:20:21,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:21" (3/3) ... [2025-03-03 19:20:21,242 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-96.i [2025-03-03 19:20:21,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:20:21,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-96.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:20:21,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:20:21,303 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;@7af9a360, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:20:21,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:20:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:20:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:20:21,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:21,318 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:21,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:21,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1724369671, now seen corresponding path program 1 times [2025-03-03 19:20:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:20:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335168189] [2025-03-03 19:20:21,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:20:21,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:21,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:21,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:21,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 19:20:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:20:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335168189] [2025-03-03 19:20:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335168189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:20:21,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53563264] [2025-03-03 19:20:21,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:21,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:20:21,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:20:21,569 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 19:20:21,572 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 19:20:21,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:21,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:21,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:21,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:21,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:20:21,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:20:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 19:20:21,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:20:21,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53563264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:20:21,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:20:21,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:20:21,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091205243] [2025-03-03 19:20:21,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:20:21,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:20:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:20:21,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:20:21,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:20:21,759 INFO L87 Difference]: Start difference. First operand has 72 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:20:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:20:21,779 INFO L93 Difference]: Finished difference Result 135 states and 234 transitions. [2025-03-03 19:20:21,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:20:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2025-03-03 19:20:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:20:21,785 INFO L225 Difference]: With dead ends: 135 [2025-03-03 19:20:21,785 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 19:20:21,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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 19:20:21,789 INFO L435 NwaCegarLoop]: 97 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, 97 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 19:20:21,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:20:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 19:20:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-03 19:20:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:20:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2025-03-03 19:20:21,845 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 167 [2025-03-03 19:20:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:20:21,846 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2025-03-03 19:20:21,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:20:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2025-03-03 19:20:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:20:21,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:21,848 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:21,855 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 19:20:22,052 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 19:20:22,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:22,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1330232604, now seen corresponding path program 1 times [2025-03-03 19:20:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:20:22,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953049558] [2025-03-03 19:20:22,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:20:22,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:22,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:22,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 30 proven. 48 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 19:20:22,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:20:22,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953049558] [2025-03-03 19:20:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953049558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:20:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904955598] [2025-03-03 19:20:22,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:22,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:20:22,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:20:22,982 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 19:20:22,983 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 19:20:23,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:23,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:23,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:23,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:23,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 19:20:23,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:20:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 944 proven. 120 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-03 19:20:23,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:20:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 69 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-03-03 19:20:24,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904955598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:20:24,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:20:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 10] total 27 [2025-03-03 19:20:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485048589] [2025-03-03 19:20:24,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:20:24,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 19:20:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:20:24,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 19:20:24,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2025-03-03 19:20:24,302 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) [2025-03-03 19:20:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:20:26,888 INFO L93 Difference]: Finished difference Result 414 states and 548 transitions. [2025-03-03 19:20:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-03-03 19:20:26,888 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) Word has length 167 [2025-03-03 19:20:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:20:26,892 INFO L225 Difference]: With dead ends: 414 [2025-03-03 19:20:26,892 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 19:20:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2307, Invalid=7793, Unknown=0, NotChecked=0, Total=10100 [2025-03-03 19:20:26,897 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 516 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 590 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 590 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:20:26,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 715 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [590 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:20:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 19:20:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 315. [2025-03-03 19:20:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 181 states have (on average 1.0773480662983426) internal successors, (195), 183 states have internal predecessors, (195), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 19:20:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 411 transitions. [2025-03-03 19:20:26,947 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 411 transitions. Word has length 167 [2025-03-03 19:20:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:20:26,948 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 411 transitions. [2025-03-03 19:20:26,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) [2025-03-03 19:20:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 411 transitions. [2025-03-03 19:20:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:20:26,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:26,950 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:26,957 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 19:20:27,152 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,SelfDestructingSolverStorable1 [2025-03-03 19:20:27,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:27,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1329309083, now seen corresponding path program 1 times [2025-03-03 19:20:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:20:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102770729] [2025-03-03 19:20:27,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:20:27,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:27,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:27,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:27,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:20:27,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:20:27,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:27,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:27,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:27,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:20:27,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:20:27,324 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:20:27,324 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:20:27,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:20:27,329 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 19:20:27,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:20:27,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:20:27 BoogieIcfgContainer [2025-03-03 19:20:27,414 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:20:27,414 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:20:27,415 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:20:27,415 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:20:27,416 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:21" (3/4) ... [2025-03-03 19:20:27,417 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:20:27,418 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:20:27,418 INFO L158 Benchmark]: Toolchain (without parser) took 6833.15ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 129.4MB in the beginning and 119.6MB in the end (delta: 9.9MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2025-03-03 19:20:27,419 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:20:27,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.36ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 115.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:20:27,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.84ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 112.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:20:27,421 INFO L158 Benchmark]: Boogie Preprocessor took 39.26ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 107.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:20:27,421 INFO L158 Benchmark]: IcfgBuilder took 348.05ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 87.0MB in the end (delta: 20.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:20:27,421 INFO L158 Benchmark]: TraceAbstraction took 6177.13ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 86.7MB in the beginning and 119.6MB in the end (delta: -32.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2025-03-03 19:20:27,421 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 201.3MB. Free memory was 119.6MB in the beginning and 119.6MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:20:27,423 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.21ms. Allocated memory is still 192.9MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.36ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 115.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.84ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 112.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.26ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 107.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 348.05ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 87.0MB in the end (delta: 20.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6177.13ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 86.7MB in the beginning and 119.6MB in the end (delta: -32.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 201.3MB. Free memory was 119.6MB in the beginning and 119.6MB in the end (delta: 36.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 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int last_1_var_1_9 = 4; VAL [isInitial=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L132] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L142] RET updateLastVariables() [L143] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L93] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L94] var_1_8 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L95] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L96] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L97] var_1_10 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L100] var_1_12 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L101] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L102] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L102] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L104] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L105] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L105] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L106] var_1_18 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L107] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L108] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L108] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L109] var_1_19 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L110] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L111] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L111] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L112] var_1_20 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L114] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L114] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L115] var_1_21 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L116] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L117] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L117] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L118] var_1_22 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L119] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L120] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L120] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L121] var_1_25 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L122] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L123] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L123] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L124] var_1_28 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L125] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L126] var_1_29 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L127] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L128] var_1_30 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L129] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L143] RET updateVariables() [L144] CALL step() [L48] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L51] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L52] COND TRUE \read(var_1_4) [L53] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L57] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L58] COND FALSE !(var_1_23 < var_1_23) [L69] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=126, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L71] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=126, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L72] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L79] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=126, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L81] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L84] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=126, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=126, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=126, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=-16386, var_1_13=-32769, var_1_17=4, var_1_18=126, var_1_19=125, var_1_1=126, var_1_20=58, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 3, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 812 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 602 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1253 IncrementalHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 210 mSDtfsCounter, 1253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 599 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=2, InterpolantAutomatonStates: 90, 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, 2 MinimizatonAttempts, 36 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 830 ConstructedInterpolants, 0 QuantifiedInterpolants, 3001 SizeOfPredicates, 6 NumberOfNonLiveVariables, 738 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 6731/7020 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 19:20:27,444 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_fillercode_fillercodesize_normal_file-96.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 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:20:29,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:20:29,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:20:29,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:20:29,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:20:29,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:20:29,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:20:29,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:20:29,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:20:29,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:20:29,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:20:29,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:20:29,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:20:29,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:20:29,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:20:29,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:20:29,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:20:29,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:20:29,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:20:29,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:20:29,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:20:29,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:20:29,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:20:29,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:20:29,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:20:29,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:20:29,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:20:29,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:20:29,413 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 -> 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 [2025-03-03 19:20:29,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:20:29,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:20:29,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:20:29,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:20:29,664 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:20:29,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i [2025-03-03 19:20:30,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/768d0b43b/2b86f02464534f18b4a7fe8ce8130aa0/FLAGed59c0d5d [2025-03-03 19:20:31,062 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:20:31,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i [2025-03-03 19:20:31,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/768d0b43b/2b86f02464534f18b4a7fe8ce8130aa0/FLAGed59c0d5d [2025-03-03 19:20:31,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/768d0b43b/2b86f02464534f18b4a7fe8ce8130aa0 [2025-03-03 19:20:31,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:20:31,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:20:31,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:20:31,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:20:31,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:20:31,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a58a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31, skipping insertion in model container [2025-03-03 19:20:31,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:20:31,220 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_fillercode_fillercodesize_normal_file-96.i[913,926] [2025-03-03 19:20:31,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:20:31,291 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:20:31,298 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_fillercode_fillercodesize_normal_file-96.i[913,926] [2025-03-03 19:20:31,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:20:31,339 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:20:31,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31 WrapperNode [2025-03-03 19:20:31,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:20:31,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:20:31,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:20:31,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:20:31,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,384 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-03-03 19:20:31,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:20:31,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:20:31,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:20:31,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:20:31,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,413 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 19:20:31,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:20:31,431 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:20:31,431 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:20:31,431 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:20:31,432 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (1/1) ... [2025-03-03 19:20:31,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:20:31,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:20:31,465 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 19:20:31,468 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 19:20:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:20:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:20:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:20:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:20:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:20:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:20:31,547 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:20:31,549 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:20:33,771 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 19:20:33,771 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:20:33,778 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:20:33,778 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:20:33,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:33 BoogieIcfgContainer [2025-03-03 19:20:33,778 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:20:33,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:20:33,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:20:33,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:20:33,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:20:31" (1/3) ... [2025-03-03 19:20:33,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d3100d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:20:33, skipping insertion in model container [2025-03-03 19:20:33,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:31" (2/3) ... [2025-03-03 19:20:33,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d3100d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:20:33, skipping insertion in model container [2025-03-03 19:20:33,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:33" (3/3) ... [2025-03-03 19:20:33,785 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-96.i [2025-03-03 19:20:33,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:20:33,796 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-96.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:20:33,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:20:33,843 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;@15e85046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:20:33,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:20:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:20:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:20:33,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:33,860 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:33,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:33,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:33,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1724369671, now seen corresponding path program 1 times [2025-03-03 19:20:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:20:33,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112651844] [2025-03-03 19:20:33,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:33,874 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 19:20:33,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:20:33,876 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 19:20:33,877 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 19:20:33,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:34,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:34,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:34,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:34,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:20:34,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:20:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 19:20:34,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:20:34,206 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:20:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112651844] [2025-03-03 19:20:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112651844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:20:34,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:20:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:20:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473966090] [2025-03-03 19:20:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:20:34,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:20:34,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:20:34,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:20:34,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:20:34,229 INFO L87 Difference]: Start difference. First operand has 72 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:20:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:20:34,248 INFO L93 Difference]: Finished difference Result 135 states and 234 transitions. [2025-03-03 19:20:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:20:34,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2025-03-03 19:20:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:20:34,256 INFO L225 Difference]: With dead ends: 135 [2025-03-03 19:20:34,256 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 19:20:34,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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 19:20:34,260 INFO L435 NwaCegarLoop]: 97 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, 97 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 19:20:34,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:20:34,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 19:20:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-03 19:20:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:20:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2025-03-03 19:20:34,296 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 167 [2025-03-03 19:20:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:20:34,297 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2025-03-03 19:20:34,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:20:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2025-03-03 19:20:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:20:34,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:34,302 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:34,311 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 19:20:34,505 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 19:20:34,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:34,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1330232604, now seen corresponding path program 1 times [2025-03-03 19:20:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:20:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083005856] [2025-03-03 19:20:34,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:34,506 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 19:20:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:20:34,508 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 19:20:34,509 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 19:20:34,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:34,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:34,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:34,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:34,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:20:34,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:20:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 928 proven. 108 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-03 19:20:35,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:20:35,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:20:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083005856] [2025-03-03 19:20:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083005856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:20:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1714566856] [2025-03-03 19:20:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:35,943 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:20:35,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:20:35,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:20:35,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 19:20:36,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:36,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:36,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:36,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:36,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:20:36,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:20:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 686 proven. 48 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2025-03-03 19:20:36,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:20:36,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1714566856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:20:36,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:20:36,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 13 [2025-03-03 19:20:36,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538560056] [2025-03-03 19:20:36,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:20:36,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:20:36,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:20:36,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:20:36,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:20:36,894 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2025-03-03 19:20:39,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:20:41,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:20:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:20:42,862 INFO L93 Difference]: Finished difference Result 226 states and 312 transitions. [2025-03-03 19:20:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 19:20:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 167 [2025-03-03 19:20:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:20:42,865 INFO L225 Difference]: With dead ends: 226 [2025-03-03 19:20:42,865 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 19:20:42,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 19:20:42,867 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 113 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:20:42,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 513 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-03 19:20:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 19:20:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2025-03-03 19:20:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 83 states have internal predecessors, (89), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 19:20:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2025-03-03 19:20:42,893 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 197 transitions. Word has length 167 [2025-03-03 19:20:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:20:42,894 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 197 transitions. [2025-03-03 19:20:42,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2025-03-03 19:20:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 197 transitions. [2025-03-03 19:20:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:20:42,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:42,895 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:42,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-03 19:20:43,104 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 19:20:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 19:20:43,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:43,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1329309083, now seen corresponding path program 1 times [2025-03-03 19:20:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:20:43,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28363987] [2025-03-03 19:20:43,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:43,298 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 19:20:43,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:20:43,300 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 19:20:43,301 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 19:20:43,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:20:43,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:20:43,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:43,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:43,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-03 19:20:43,591 INFO L279 TraceCheckSpWp]: Computing forward predicates...