./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.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_fillercodestructure_filler-pr-ci_file-32.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 a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:02:45,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:02:45,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:02:45,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:02:45,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:02:45,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:02:45,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:02:45,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:02:45,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:02:45,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:02:45,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:02:45,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:02:45,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:02:45,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:02:45,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:02:45,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:02:45,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:02:45,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:02:45,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:02:45,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:02:45,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:02:45,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:02:45,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:02:45,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:02:45,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:02:45,151 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 -> a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 [2025-03-03 21:02:45,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:02:45,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:02:45,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:02:45,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:02:45,382 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:02:45,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2025-03-03 21:02:46,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4735809/e047a2dc38b343d681b70670f39b0d5f/FLAG76d7bc211 [2025-03-03 21:02:46,717 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:02:46,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2025-03-03 21:02:46,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4735809/e047a2dc38b343d681b70670f39b0d5f/FLAG76d7bc211 [2025-03-03 21:02:46,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4735809/e047a2dc38b343d681b70670f39b0d5f [2025-03-03 21:02:46,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:02:46,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:02:46,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:02:46,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:02:46,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:02:46,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:46,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc3980a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46, skipping insertion in model container [2025-03-03 21:02:46,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:46,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:02:46,860 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_fillercodestructure_filler-pr-ci_file-32.i[919,932] [2025-03-03 21:02:46,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:02:46,923 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:02:46,929 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_fillercodestructure_filler-pr-ci_file-32.i[919,932] [2025-03-03 21:02:46,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:02:46,957 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:02:46,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46 WrapperNode [2025-03-03 21:02:46,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:02:46,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:02:46,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:02:46,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:02:46,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:46,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:46,990 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 234 [2025-03-03 21:02:46,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:02:46,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:02:46,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:02:46,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:02:46,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:46,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:46,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:47,017 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 21:02:47,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:47,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:47,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:47,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:47,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:47,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:47,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:02:47,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:02:47,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:02:47,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:02:47,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (1/1) ... [2025-03-03 21:02:47,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:02:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:02:47,058 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 21:02:47,063 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 21:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:02:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:02:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:02:47,145 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:02:47,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:02:47,464 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 21:02:47,464 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:02:47,481 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:02:47,481 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:02:47,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:02:47 BoogieIcfgContainer [2025-03-03 21:02:47,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:02:47,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:02:47,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:02:47,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:02:47,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:02:46" (1/3) ... [2025-03-03 21:02:47,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559e34ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:02:47, skipping insertion in model container [2025-03-03 21:02:47,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:46" (2/3) ... [2025-03-03 21:02:47,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559e34ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:02:47, skipping insertion in model container [2025-03-03 21:02:47,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:02:47" (3/3) ... [2025-03-03 21:02:47,487 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2025-03-03 21:02:47,497 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:02:47,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:02:47,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:02:47,541 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;@88068f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:02:47,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:02:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 73 states have internal predecessors, (111), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:02:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 21:02:47,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:47,553 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:47,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:47,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:47,556 INFO L85 PathProgramCache]: Analyzing trace with hash 485934410, now seen corresponding path program 1 times [2025-03-03 21:02:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695316530] [2025-03-03 21:02:47,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:47,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:02:47,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:02:47,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:47,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 21:02:47,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695316530] [2025-03-03 21:02:47,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695316530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:02:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61965443] [2025-03-03 21:02:47,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:47,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:02:47,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:02:47,812 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 21:02:47,814 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 21:02:47,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:02:47,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:02:47,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:47,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:47,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:02:47,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:02:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 21:02:47,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:02:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61965443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:02:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:02:47,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426689574] [2025-03-03 21:02:47,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:47,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:02:47,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:48,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:02:48,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:02:48,005 INFO L87 Difference]: Start difference. First operand has 98 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 73 states have internal predecessors, (111), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:02:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:48,036 INFO L93 Difference]: Finished difference Result 190 states and 332 transitions. [2025-03-03 21:02:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:02:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-03-03 21:02:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:48,045 INFO L225 Difference]: With dead ends: 190 [2025-03-03 21:02:48,045 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 21:02:48,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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 21:02:48,049 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:48,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:02:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 21:02:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-03 21:02:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 70 states have internal predecessors, (104), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:02:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 150 transitions. [2025-03-03 21:02:48,081 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 150 transitions. Word has length 156 [2025-03-03 21:02:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:48,082 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 150 transitions. [2025-03-03 21:02:48,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:02:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 150 transitions. [2025-03-03 21:02:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 21:02:48,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:48,084 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:48,091 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 21:02:48,285 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 21:02:48,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:48,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1267797099, now seen corresponding path program 1 times [2025-03-03 21:02:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622172879] [2025-03-03 21:02:48,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:48,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:02:48,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:02:48,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:48,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:02:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:48,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622172879] [2025-03-03 21:02:48,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622172879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:48,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:02:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:02:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183306664] [2025-03-03 21:02:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:48,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:02:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:48,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:02:48,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:02:48,753 INFO L87 Difference]: Start difference. First operand 95 states and 150 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:02:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:49,083 INFO L93 Difference]: Finished difference Result 335 states and 531 transitions. [2025-03-03 21:02:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:02:49,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2025-03-03 21:02:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:49,089 INFO L225 Difference]: With dead ends: 335 [2025-03-03 21:02:49,090 INFO L226 Difference]: Without dead ends: 243 [2025-03-03 21:02:49,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:02:49,092 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 202 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:49,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 460 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:02:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-03 21:02:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 236. [2025-03-03 21:02:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 184 states have (on average 1.4891304347826086) internal successors, (274), 185 states have internal predecessors, (274), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:02:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 370 transitions. [2025-03-03 21:02:49,113 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 370 transitions. Word has length 156 [2025-03-03 21:02:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:49,114 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 370 transitions. [2025-03-03 21:02:49,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:02:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 370 transitions. [2025-03-03 21:02:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 21:02:49,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:49,115 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:49,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:02:49,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:49,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -666087717, now seen corresponding path program 1 times [2025-03-03 21:02:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:49,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228674789] [2025-03-03 21:02:49,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:49,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 21:02:49,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 21:02:49,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:49,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:02:49,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:49,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228674789] [2025-03-03 21:02:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228674789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:02:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:02:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432435314] [2025-03-03 21:02:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:49,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:02:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:49,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:02:49,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:02:49,274 INFO L87 Difference]: Start difference. First operand 236 states and 370 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:02:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:49,391 INFO L93 Difference]: Finished difference Result 472 states and 740 transitions. [2025-03-03 21:02:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:02:49,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 157 [2025-03-03 21:02:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:49,394 INFO L225 Difference]: With dead ends: 472 [2025-03-03 21:02:49,394 INFO L226 Difference]: Without dead ends: 239 [2025-03-03 21:02:49,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:02:49,396 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 133 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:49,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 476 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:02:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-03 21:02:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2025-03-03 21:02:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 184 states have (on average 1.483695652173913) internal successors, (273), 185 states have internal predecessors, (273), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:02:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 369 transitions. [2025-03-03 21:02:49,413 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 369 transitions. Word has length 157 [2025-03-03 21:02:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:49,413 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 369 transitions. [2025-03-03 21:02:49,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:02:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 369 transitions. [2025-03-03 21:02:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:02:49,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:49,415 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:49,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:02:49,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:49,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash -837849094, now seen corresponding path program 1 times [2025-03-03 21:02:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462651004] [2025-03-03 21:02:49,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:49,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:02:49,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:02:49,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:49,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:02:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462651004] [2025-03-03 21:02:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462651004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:49,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:02:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:02:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516862723] [2025-03-03 21:02:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:02:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:02:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:02:49,678 INFO L87 Difference]: Start difference. First operand 236 states and 369 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:02:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:49,855 INFO L93 Difference]: Finished difference Result 611 states and 955 transitions. [2025-03-03 21:02:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:02:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2025-03-03 21:02:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:49,858 INFO L225 Difference]: With dead ends: 611 [2025-03-03 21:02:49,858 INFO L226 Difference]: Without dead ends: 378 [2025-03-03 21:02:49,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:02:49,859 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 274 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:49,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 449 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:02:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-03 21:02:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 303. [2025-03-03 21:02:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 250 states have internal predecessors, (376), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 21:02:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 476 transitions. [2025-03-03 21:02:49,884 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 476 transitions. Word has length 158 [2025-03-03 21:02:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:49,884 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 476 transitions. [2025-03-03 21:02:49,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:02:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 476 transitions. [2025-03-03 21:02:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:02:49,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:49,886 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:49,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:02:49,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:49,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:49,886 INFO L85 PathProgramCache]: Analyzing trace with hash 384636325, now seen corresponding path program 1 times [2025-03-03 21:02:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:49,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153670236] [2025-03-03 21:02:49,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:49,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:49,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:02:49,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:02:49,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:49,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:02:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:50,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153670236] [2025-03-03 21:02:50,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153670236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:50,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:02:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:02:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198578797] [2025-03-03 21:02:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:50,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:02:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:50,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:02:50,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:02:50,084 INFO L87 Difference]: Start difference. First operand 303 states and 476 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:02:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:50,341 INFO L93 Difference]: Finished difference Result 642 states and 1001 transitions. [2025-03-03 21:02:50,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:02:50,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2025-03-03 21:02:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:50,344 INFO L225 Difference]: With dead ends: 642 [2025-03-03 21:02:50,344 INFO L226 Difference]: Without dead ends: 342 [2025-03-03 21:02:50,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:02:50,345 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 285 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:50,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 544 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:02:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-03 21:02:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 307. [2025-03-03 21:02:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 252 states have (on average 1.5238095238095237) internal successors, (384), 254 states have internal predecessors, (384), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 21:02:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 484 transitions. [2025-03-03 21:02:50,362 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 484 transitions. Word has length 159 [2025-03-03 21:02:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:50,362 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 484 transitions. [2025-03-03 21:02:50,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:02:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 484 transitions. [2025-03-03 21:02:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:02:50,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:50,364 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:50,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:02:50,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:50,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1617598967, now seen corresponding path program 1 times [2025-03-03 21:02:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817797839] [2025-03-03 21:02:50,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:50,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:02:50,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:02:50,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:50,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:02:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817797839] [2025-03-03 21:02:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817797839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:02:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85760431] [2025-03-03 21:02:50,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:50,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:02:50,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:02:50,582 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 21:02:50,583 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 21:02:50,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:02:50,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:02:50,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:50,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:50,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:02:50,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:02:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 21:02:50,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:02:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:02:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85760431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:02:50,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:02:50,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 21:02:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241297] [2025-03-03 21:02:50,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:02:50,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:02:50,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:50,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:02:50,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:02:50,975 INFO L87 Difference]: Start difference. First operand 307 states and 484 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-03-03 21:02:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:51,281 INFO L93 Difference]: Finished difference Result 673 states and 1033 transitions. [2025-03-03 21:02:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:02:51,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 159 [2025-03-03 21:02:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:51,285 INFO L225 Difference]: With dead ends: 673 [2025-03-03 21:02:51,285 INFO L226 Difference]: Without dead ends: 369 [2025-03-03 21:02:51,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:02:51,287 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 352 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:51,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 321 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:02:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-03 21:02:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2025-03-03 21:02:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 285 states have (on average 1.4210526315789473) internal successors, (405), 288 states have internal predecessors, (405), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 21:02:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 533 transitions. [2025-03-03 21:02:51,314 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 533 transitions. Word has length 159 [2025-03-03 21:02:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:51,314 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 533 transitions. [2025-03-03 21:02:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-03-03 21:02:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 533 transitions. [2025-03-03 21:02:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:02:51,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:51,316 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:51,322 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 21:02:51,520 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,SelfDestructingSolverStorable5 [2025-03-03 21:02:51,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:51,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1058541854, now seen corresponding path program 1 times [2025-03-03 21:02:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896906555] [2025-03-03 21:02:51,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:51,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:02:51,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:02:51,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:51,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:02:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896906555] [2025-03-03 21:02:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896906555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:02:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:02:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753791721] [2025-03-03 21:02:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:51,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:02:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:51,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:02:51,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:02:51,641 INFO L87 Difference]: Start difference. First operand 362 states and 533 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:02:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:51,797 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2025-03-03 21:02:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:02:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-03-03 21:02:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:51,800 INFO L225 Difference]: With dead ends: 715 [2025-03-03 21:02:51,801 INFO L226 Difference]: Without dead ends: 387 [2025-03-03 21:02:51,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:02:51,802 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 246 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:51,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 448 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:02:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-03 21:02:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 358. [2025-03-03 21:02:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 281 states have (on average 1.4199288256227758) internal successors, (399), 284 states have internal predecessors, (399), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 21:02:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 527 transitions. [2025-03-03 21:02:51,832 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 527 transitions. Word has length 160 [2025-03-03 21:02:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:51,833 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 527 transitions. [2025-03-03 21:02:51,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:02:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 527 transitions. [2025-03-03 21:02:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 21:02:51,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:51,834 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:51,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:02:51,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:51,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:51,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1335945573, now seen corresponding path program 1 times [2025-03-03 21:02:51,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:51,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082576746] [2025-03-03 21:02:51,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:51,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:51,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 21:02:51,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 21:02:51,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:51,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:02:52,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082576746] [2025-03-03 21:02:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082576746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:02:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700924018] [2025-03-03 21:02:52,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:52,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:02:52,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:02:52,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:02:52,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:02:52,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 21:02:52,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 21:02:52,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:52,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:52,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:02:52,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:02:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 21:02:52,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:02:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:02:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700924018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:02:53,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:02:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2025-03-03 21:02:53,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508644269] [2025-03-03 21:02:53,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:02:53,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:02:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:53,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:02:53,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:02:53,407 INFO L87 Difference]: Start difference. First operand 358 states and 527 transitions. Second operand has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2025-03-03 21:02:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:54,712 INFO L93 Difference]: Finished difference Result 1259 states and 1791 transitions. [2025-03-03 21:02:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 21:02:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 161 [2025-03-03 21:02:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:54,720 INFO L225 Difference]: With dead ends: 1259 [2025-03-03 21:02:54,720 INFO L226 Difference]: Without dead ends: 935 [2025-03-03 21:02:54,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=637, Invalid=1813, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 21:02:54,723 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1916 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:54,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 715 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:02:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-03 21:02:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 692. [2025-03-03 21:02:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 574 states have (on average 1.4547038327526132) internal successors, (835), 579 states have internal predecessors, (835), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 88 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 21:02:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1021 transitions. [2025-03-03 21:02:54,776 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1021 transitions. Word has length 161 [2025-03-03 21:02:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:54,777 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1021 transitions. [2025-03-03 21:02:54,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2025-03-03 21:02:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1021 transitions. [2025-03-03 21:02:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 21:02:54,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:54,780 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:54,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 21:02:54,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:02:54,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:54,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1364574724, now seen corresponding path program 1 times [2025-03-03 21:02:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:54,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989662890] [2025-03-03 21:02:54,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:54,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 21:02:55,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 21:02:55,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:55,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 57 proven. 9 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:02:55,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:55,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989662890] [2025-03-03 21:02:55,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989662890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:02:55,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486665074] [2025-03-03 21:02:55,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:55,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:02:55,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:02:55,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:02:55,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:02:55,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 21:02:55,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 21:02:55,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:55,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:55,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 21:02:55,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:02:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 669 proven. 135 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-03 21:02:56,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:02:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486665074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:02:57,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:02:57,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15] total 20 [2025-03-03 21:02:57,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904849776] [2025-03-03 21:02:57,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:02:57,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 21:02:57,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:57,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 21:02:57,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:02:57,469 INFO L87 Difference]: Start difference. First operand 692 states and 1021 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 7 states have call predecessors, (46), 7 states have call successors, (46) [2025-03-03 21:02:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:58,347 INFO L93 Difference]: Finished difference Result 955 states and 1362 transitions. [2025-03-03 21:02:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 21:02:58,348 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 7 states have call predecessors, (46), 7 states have call successors, (46) Word has length 161 [2025-03-03 21:02:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:58,351 INFO L225 Difference]: With dead ends: 955 [2025-03-03 21:02:58,351 INFO L226 Difference]: Without dead ends: 301 [2025-03-03 21:02:58,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=475, Invalid=1417, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 21:02:58,353 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 938 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:58,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 365 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:02:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-03 21:02:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 262. [2025-03-03 21:02:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 207 states have internal predecessors, (269), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 21:02:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 347 transitions. [2025-03-03 21:02:58,378 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 347 transitions. Word has length 161 [2025-03-03 21:02:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:58,378 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 347 transitions. [2025-03-03 21:02:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 7 states have call predecessors, (46), 7 states have call successors, (46) [2025-03-03 21:02:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 347 transitions. [2025-03-03 21:02:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 21:02:58,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:58,381 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:58,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 21:02:58,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:02:58,582 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 520102853, now seen corresponding path program 1 times [2025-03-03 21:02:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008932492] [2025-03-03 21:02:58,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:58,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 21:02:58,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 21:02:58,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:02:58,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:02:58,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 21:02:58,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 21:02:58,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:58,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:02:58,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:02:58,722 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:02:58,723 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:02:58,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:02:58,730 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:58,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:02:58,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:02:58 BoogieIcfgContainer [2025-03-03 21:02:58,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:02:58,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:02:58,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:02:58,825 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:02:58,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:02:47" (3/4) ... [2025-03-03 21:02:58,828 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:02:58,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:02:58,829 INFO L158 Benchmark]: Toolchain (without parser) took 12092.80ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 106.7MB in the beginning and 371.8MB in the end (delta: -265.1MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2025-03-03 21:02:58,829 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:02:58,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.81ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 91.5MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:02:58,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.53ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 87.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:02:58,830 INFO L158 Benchmark]: Boogie Preprocessor took 40.89ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 81.4MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:02:58,830 INFO L158 Benchmark]: IcfgBuilder took 449.72ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 51.8MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:02:58,830 INFO L158 Benchmark]: TraceAbstraction took 11341.94ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 51.3MB in the beginning and 371.9MB in the end (delta: -320.6MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2025-03-03 21:02:58,830 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 419.4MB. Free memory was 371.9MB in the beginning and 371.8MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:02:58,831 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.81ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 91.5MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.53ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 87.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.89ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 81.4MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 449.72ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 51.8MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11341.94ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 51.3MB in the beginning and 371.9MB in the end (delta: -320.6MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 419.4MB. Free memory was 371.9MB in the beginning and 371.8MB in the end (delta: 101.6kB). 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 157, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_32 = 2219578776; [L44] unsigned char var_1_34 = 0; [L45] unsigned char var_1_36 = 5; [L46] unsigned char var_1_41 = 32; [L47] double var_1_42 = 16.125; [L48] double var_1_43 = 256.5; [L49] signed short int var_1_45 = -10; [L50] unsigned char last_1_var_1_1 = 2; [L51] unsigned char last_1_var_1_15 = 1; [L52] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L139] var_1_4 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L140] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L142] var_1_5 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L143] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] var_1_6 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_8=32, var_1_9=201/2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_8=32, var_1_9=201/2] [L150] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=32, var_1_9=201/2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_9=201/2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_9=201/2] [L153] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L154] var_1_11 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L155] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L156] var_1_12 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L161] var_1_17 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L162] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L164] var_1_19 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L165] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L166] var_1_21 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L169] var_1_32 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L170] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L172] var_1_42 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L173] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L190] RET updateVariables() [L191] CALL step() [L56] COND FALSE !(var_1_5 >= var_1_6) [L65] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L67] unsigned char stepLocal_1 = var_1_15; [L68] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L69] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L70] COND TRUE var_1_15 && stepLocal_1 [L71] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR ((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR ((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] COND FALSE !(var_1_6 < ((((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5))))) [L85] COND FALSE !((var_1_5 - var_1_6) <= (~ (var_1_32 - var_1_8))) [L88] var_1_25 = -32 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L91] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L100] COND FALSE !((var_1_11 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_12) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L103] COND TRUE var_1_11 == var_1_18 [L104] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L106] COND TRUE var_1_8 >= -25 [L107] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L109] COND TRUE (var_1_11 - var_1_12) >= (var_1_19 * var_1_12) [L110] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L112] COND FALSE !((((((var_1_19) < (var_1_11)) ? (var_1_19) : (var_1_11))) >= (var_1_12 / var_1_42)) || var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] EXPR var_1_1 & var_1_7 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] EXPR var_1_4 ^ (var_1_1 & var_1_7) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] COND TRUE var_1_5 <= (var_1_4 ^ (var_1_1 & var_1_7)) [L118] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L126] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=201/2] [L129] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L132] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L134] var_1_22 = var_1_12 [L135] var_1_23 = var_1_8 [L136] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=127, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=127, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=127, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-31, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=127, var_1_25=-32, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=-65153, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=2219578781] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 10, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4360 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4346 mSDsluCounter, 3922 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2812 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2652 IncrementalHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 1110 mSDtfsCounter, 2652 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1144 GetRequests, 1007 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=692occurred in iteration=8, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 438 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2225 NumberOfCodeBlocks, 2225 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2369 ConstructedInterpolants, 0 QuantifiedInterpolants, 10278 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1534 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 14716/15180 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 21:02:58,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_fillercodestructure_filler-pr-ci_file-32.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 a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:03:00,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:03:00,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:03:00,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:03:00,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:03:00,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:03:00,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:03:00,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:03:00,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:03:00,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:03:00,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:03:00,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:03:00,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:03:00,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:03:00,819 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:03:00,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:03:00,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:03:00,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:03:00,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:03:00,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:03:00,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:03:00,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:03:00,822 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 -> a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 [2025-03-03 21:03:01,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:03:01,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:03:01,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:03:01,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:03:01,072 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:03:01,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2025-03-03 21:03:02,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72cb1bbd/36daa5a716164c968c3f4ab3230062d0/FLAG446b50d3b [2025-03-03 21:03:02,476 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:03:02,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2025-03-03 21:03:02,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72cb1bbd/36daa5a716164c968c3f4ab3230062d0/FLAG446b50d3b [2025-03-03 21:03:02,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72cb1bbd/36daa5a716164c968c3f4ab3230062d0 [2025-03-03 21:03:02,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:03:02,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:03:02,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:03:02,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:03:02,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:03:02,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:03:02" (1/1) ... [2025-03-03 21:03:02,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2156610c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:02, skipping insertion in model container [2025-03-03 21:03:02,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:03:02" (1/1) ... [2025-03-03 21:03:02,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:03:02,994 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_fillercodestructure_filler-pr-ci_file-32.i[919,932] [2025-03-03 21:03:03,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:03:03,083 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:03:03,092 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_fillercodestructure_filler-pr-ci_file-32.i[919,932] [2025-03-03 21:03:03,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:03:03,147 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:03:03,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03 WrapperNode [2025-03-03 21:03:03,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:03:03,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:03:03,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:03:03,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:03:03,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,200 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-03 21:03:03,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:03:03,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:03:03,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:03:03,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:03:03,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,227 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 21:03:03,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:03:03,241 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:03:03,241 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:03:03,241 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:03:03,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (1/1) ... [2025-03-03 21:03:03,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:03:03,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:03:03,272 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 21:03:03,275 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 21:03:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:03:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:03:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:03:03,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:03:03,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:03:03,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:03:03,372 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:03:03,374 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:03:26,060 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 21:03:26,060 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:03:26,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:03:26,067 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:03:26,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:03:26 BoogieIcfgContainer [2025-03-03 21:03:26,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:03:26,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:03:26,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:03:26,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:03:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:03:02" (1/3) ... [2025-03-03 21:03:26,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289b0f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:03:26, skipping insertion in model container [2025-03-03 21:03:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:03:03" (2/3) ... [2025-03-03 21:03:26,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289b0f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:03:26, skipping insertion in model container [2025-03-03 21:03:26,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:03:26" (3/3) ... [2025-03-03 21:03:26,074 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2025-03-03 21:03:26,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:03:26,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:03:26,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:03:26,139 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;@5da6b61a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:03:26,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:03:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:03:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:03:26,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:03:26,149 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:03:26,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:03:26,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:03:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash -206063420, now seen corresponding path program 1 times [2025-03-03 21:03:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:03:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093789446] [2025-03-03 21:03:26,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:26,163 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 21:03:26,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:03:26,165 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 21:03:26,166 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 21:03:26,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:03:27,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:03:27,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:27,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:27,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:03:27,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:03:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-03 21:03:27,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:03:27,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:03:27,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093789446] [2025-03-03 21:03:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093789446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:03:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:03:27,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:03:27,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894363552] [2025-03-03 21:03:27,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:03:27,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:03:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:03:27,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:03:27,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:03:27,807 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:03:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:03:27,824 INFO L93 Difference]: Finished difference Result 150 states and 266 transitions. [2025-03-03 21:03:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:03:27,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2025-03-03 21:03:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:03:27,830 INFO L225 Difference]: With dead ends: 150 [2025-03-03 21:03:27,830 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 21:03:27,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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 21:03:27,839 INFO L435 NwaCegarLoop]: 115 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, 115 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 21:03:27,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:03:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 21:03:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-03 21:03:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:03:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 115 transitions. [2025-03-03 21:03:27,884 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 115 transitions. Word has length 152 [2025-03-03 21:03:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:03:27,884 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 115 transitions. [2025-03-03 21:03:27,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:03:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 115 transitions. [2025-03-03 21:03:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:03:27,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:03:27,887 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:03:27,923 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 21:03:28,088 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 21:03:28,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:03:28,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:03:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1966340385, now seen corresponding path program 1 times [2025-03-03 21:03:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:03:28,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264323536] [2025-03-03 21:03:28,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:28,090 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 21:03:28,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:03:28,092 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 21:03:28,093 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 21:03:28,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:03:29,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:03:29,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:29,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:29,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:03:29,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:03:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 21:03:31,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:03:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:03:34,822 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:03:34,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264323536] [2025-03-03 21:03:34,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264323536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:03:34,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:03:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 21:03:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926624724] [2025-03-03 21:03:34,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:03:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:03:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:03:34,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:03:34,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:03:34,825 INFO L87 Difference]: Start difference. First operand 74 states and 115 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 21:03:39,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:03:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:03:40,966 INFO L93 Difference]: Finished difference Result 177 states and 272 transitions. [2025-03-03 21:03:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:03:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 152 [2025-03-03 21:03:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:03:40,968 INFO L225 Difference]: With dead ends: 177 [2025-03-03 21:03:40,968 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 21:03:40,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:03:40,969 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 70 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:03:40,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 266 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-03 21:03:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 21:03:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2025-03-03 21:03:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 62 states have internal predecessors, (80), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 21:03:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2025-03-03 21:03:40,984 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 152 [2025-03-03 21:03:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:03:40,984 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2025-03-03 21:03:40,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 21:03:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2025-03-03 21:03:40,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 21:03:40,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:03:40,986 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:03:41,023 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 21:03:41,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:03:41,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:03:41,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:03:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash -722698271, now seen corresponding path program 1 times [2025-03-03 21:03:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:03:41,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594552141] [2025-03-03 21:03:41,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:41,188 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 21:03:41,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:03:41,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:03:41,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 21:03:41,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 21:03:42,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 21:03:42,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:42,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:42,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 21:03:42,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:04:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 150 proven. 177 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-03-03 21:04:02,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:04:03,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:04:03,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594552141] [2025-03-03 21:04:03,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594552141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:04:03,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1318559221] [2025-03-03 21:04:03,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:04:03,443 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:04:03,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:04:03,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:04:03,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 21:04:03,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 21:04:06,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 21:04:06,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:04:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:04:06,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 21:04:06,401 INFO L279 TraceCheckSpWp]: Computing forward predicates...