./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-74.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-ps-ci_file-74.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 ef09520730e82204e9b1168e46fbb148d498860060e48e36c72de6a0ddbbcce2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:42:37,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:42:37,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:42:37,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:42:37,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:42:37,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:42:37,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:42:37,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:42:37,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:42:37,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:42:37,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:42:37,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:42:37,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:42:37,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:42:37,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:42:37,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:42:37,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:42:37,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:42:37,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:42:37,168 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 -> ef09520730e82204e9b1168e46fbb148d498860060e48e36c72de6a0ddbbcce2 [2025-03-03 21:42:37,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:42:37,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:42:37,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:42:37,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:42:37,397 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:42:37,398 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-ps-ci_file-74.i [2025-03-03 21:42:38,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd18fb24/7d4c73dbfd294c76be55e2abd993b642/FLAG9e5876e52 [2025-03-03 21:42:38,782 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:42:38,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-74.i [2025-03-03 21:42:38,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd18fb24/7d4c73dbfd294c76be55e2abd993b642/FLAG9e5876e52 [2025-03-03 21:42:39,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd18fb24/7d4c73dbfd294c76be55e2abd993b642 [2025-03-03 21:42:39,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:42:39,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:42:39,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:42:39,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:42:39,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:42:39,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39, skipping insertion in model container [2025-03-03 21:42:39,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:42:39,197 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-ps-ci_file-74.i[919,932] [2025-03-03 21:42:39,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:42:39,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:42:39,257 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-ps-ci_file-74.i[919,932] [2025-03-03 21:42:39,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:42:39,298 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:42:39,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39 WrapperNode [2025-03-03 21:42:39,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:42:39,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:42:39,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:42:39,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:42:39,305 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:42:39" (1/1) ... [2025-03-03 21:42:39,311 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:42:39" (1/1) ... [2025-03-03 21:42:39,335 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-03-03 21:42:39,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:42:39,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:42:39,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:42:39,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:42:39,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,363 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:42:39,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:42:39,391 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:42:39,391 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:42:39,391 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:42:39,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (1/1) ... [2025-03-03 21:42:39,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:42:39,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:42:39,416 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:42:39,421 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:42:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:42:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:42:39,436 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:42:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:42:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:42:39,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:42:39,502 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:42:39,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:42:39,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2025-03-03 21:42:39,905 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 21:42:39,905 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:42:39,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:42:39,919 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 21:42:39,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:39 BoogieIcfgContainer [2025-03-03 21:42:39,919 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:42:39,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:42:39,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:42:39,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:42:39,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:42:39" (1/3) ... [2025-03-03 21:42:39,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcf583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:39, skipping insertion in model container [2025-03-03 21:42:39,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:39" (2/3) ... [2025-03-03 21:42:39,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcf583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:39, skipping insertion in model container [2025-03-03 21:42:39,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:39" (3/3) ... [2025-03-03 21:42:39,928 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-74.i [2025-03-03 21:42:39,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:42:39,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-74.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:42:39,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:42:39,991 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;@7c57cc9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:42:39,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:42:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:42:40,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:42:40,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:40,005 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:40,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:40,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1373716299, now seen corresponding path program 1 times [2025-03-03 21:42:40,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970522166] [2025-03-03 21:42:40,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:40,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:42:40,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:42:40,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:40,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:42:40,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:40,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970522166] [2025-03-03 21:42:40,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970522166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:42:40,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298936270] [2025-03-03 21:42:40,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:40,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:42:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:42:40,290 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:42:40,292 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:42:40,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:42:40,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:42:40,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:40,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:40,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:42:40,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:42:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:42:40,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:42:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298936270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:42:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:42:40,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528613208] [2025-03-03 21:42:40,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:40,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:42:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:40,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:42:40,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:42:40,475 INFO L87 Difference]: Start difference. First operand has 98 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:42:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:40,497 INFO L93 Difference]: Finished difference Result 189 states and 319 transitions. [2025-03-03 21:42:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:42:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2025-03-03 21:42:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:40,503 INFO L225 Difference]: With dead ends: 189 [2025-03-03 21:42:40,503 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 21:42:40,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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:42:40,508 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:40,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:42:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 21:42:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 21:42:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:42:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2025-03-03 21:42:40,545 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 155 [2025-03-03 21:42:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:40,545 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2025-03-03 21:42:40,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:42:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2025-03-03 21:42:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:42:40,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:40,547 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:40,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:42:40,748 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:42:40,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:40,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1636980530, now seen corresponding path program 1 times [2025-03-03 21:42:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:40,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995900080] [2025-03-03 21:42:40,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:40,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:42:40,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:42:40,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:40,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:40,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:40,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995900080] [2025-03-03 21:42:40,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995900080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:40,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:40,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:42:40,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401124054] [2025-03-03 21:42:40,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:40,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:42:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:40,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:42:40,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:42:40,942 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:41,021 INFO L93 Difference]: Finished difference Result 235 states and 350 transitions. [2025-03-03 21:42:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:42:41,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-03-03 21:42:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:41,025 INFO L225 Difference]: With dead ends: 235 [2025-03-03 21:42:41,025 INFO L226 Difference]: Without dead ends: 144 [2025-03-03 21:42:41,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:42:41,026 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:41,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 255 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:42:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-03 21:42:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2025-03-03 21:42:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 109 states have internal predecessors, (148), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 21:42:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2025-03-03 21:42:41,040 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 155 [2025-03-03 21:42:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:41,041 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2025-03-03 21:42:41,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2025-03-03 21:42:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:42:41,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:41,042 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:41,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:42:41,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:41,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash 850532303, now seen corresponding path program 1 times [2025-03-03 21:42:41,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:41,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365732632] [2025-03-03 21:42:41,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:41,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:41,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:42:41,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:42:41,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:41,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365732632] [2025-03-03 21:42:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365732632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:41,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:42:41,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981089380] [2025-03-03 21:42:41,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:41,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:42:41,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:41,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:42:41,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:42:41,414 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:41,455 INFO L93 Difference]: Finished difference Result 371 states and 552 transitions. [2025-03-03 21:42:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:42:41,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-03-03 21:42:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:41,459 INFO L225 Difference]: With dead ends: 371 [2025-03-03 21:42:41,459 INFO L226 Difference]: Without dead ends: 233 [2025-03-03 21:42:41,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:42:41,460 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:41,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 255 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:42:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-03 21:42:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2025-03-03 21:42:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 140 states have internal predecessors, (181), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:42:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 285 transitions. [2025-03-03 21:42:41,477 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 285 transitions. Word has length 155 [2025-03-03 21:42:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:41,477 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 285 transitions. [2025-03-03 21:42:41,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 285 transitions. [2025-03-03 21:42:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 21:42:41,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:41,479 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:41,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:42:41,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:41,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash 335271076, now seen corresponding path program 1 times [2025-03-03 21:42:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:41,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155806150] [2025-03-03 21:42:41,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:41,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 21:42:41,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 21:42:41,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:41,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:42,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155806150] [2025-03-03 21:42:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155806150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:42,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:42,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:42:42,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139867966] [2025-03-03 21:42:42,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:42,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:42:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:42,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:42:42,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:42:42,440 INFO L87 Difference]: Start difference. First operand 196 states and 285 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:42:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:43,438 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2025-03-03 21:42:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:42:43,438 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 157 [2025-03-03 21:42:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:43,442 INFO L225 Difference]: With dead ends: 864 [2025-03-03 21:42:43,442 INFO L226 Difference]: Without dead ends: 726 [2025-03-03 21:42:43,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:42:43,444 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 764 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:43,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 934 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:42:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-03 21:42:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 543. [2025-03-03 21:42:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 409 states have (on average 1.3251833740831296) internal successors, (542), 415 states have internal predecessors, (542), 120 states have call successors, (120), 13 states have call predecessors, (120), 13 states have return successors, (120), 114 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 21:42:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 782 transitions. [2025-03-03 21:42:43,504 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 782 transitions. Word has length 157 [2025-03-03 21:42:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:43,505 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 782 transitions. [2025-03-03 21:42:43,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:42:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 782 transitions. [2025-03-03 21:42:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 21:42:43,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:43,508 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:43,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:42:43,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:43,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1222774757, now seen corresponding path program 1 times [2025-03-03 21:42:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961153941] [2025-03-03 21:42:43,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:43,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 21:42:43,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 21:42:43,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:43,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:43,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:43,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961153941] [2025-03-03 21:42:43,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961153941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:43,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:43,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:42:43,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220528238] [2025-03-03 21:42:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:43,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:42:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:43,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:42:43,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:42:43,797 INFO L87 Difference]: Start difference. First operand 543 states and 782 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:44,059 INFO L93 Difference]: Finished difference Result 1262 states and 1830 transitions. [2025-03-03 21:42:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:42:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2025-03-03 21:42:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:44,066 INFO L225 Difference]: With dead ends: 1262 [2025-03-03 21:42:44,067 INFO L226 Difference]: Without dead ends: 788 [2025-03-03 21:42:44,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:42:44,070 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 125 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:44,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 419 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:42:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-03 21:42:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 587. [2025-03-03 21:42:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 453 states have (on average 1.346578366445916) internal successors, (610), 459 states have internal predecessors, (610), 120 states have call successors, (120), 13 states have call predecessors, (120), 13 states have return successors, (120), 114 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 21:42:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 850 transitions. [2025-03-03 21:42:44,109 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 850 transitions. Word has length 157 [2025-03-03 21:42:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:44,109 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 850 transitions. [2025-03-03 21:42:44,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 850 transitions. [2025-03-03 21:42:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:42:44,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:44,110 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:44,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:42:44,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:44,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1158730503, now seen corresponding path program 1 times [2025-03-03 21:42:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:44,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84081966] [2025-03-03 21:42:44,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:44,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:42:44,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:42:44,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:44,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84081966] [2025-03-03 21:42:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84081966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:42:44,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823115236] [2025-03-03 21:42:44,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:44,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:42:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:44,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:42:44,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:42:44,452 INFO L87 Difference]: Start difference. First operand 587 states and 850 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:44,777 INFO L93 Difference]: Finished difference Result 1262 states and 1824 transitions. [2025-03-03 21:42:44,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:42:44,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2025-03-03 21:42:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:44,781 INFO L225 Difference]: With dead ends: 1262 [2025-03-03 21:42:44,781 INFO L226 Difference]: Without dead ends: 788 [2025-03-03 21:42:44,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:42:44,782 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 123 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:44,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 491 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:42:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-03 21:42:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 593. [2025-03-03 21:42:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 459 states have (on average 1.3420479302832244) internal successors, (616), 465 states have internal predecessors, (616), 120 states have call successors, (120), 13 states have call predecessors, (120), 13 states have return successors, (120), 114 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 21:42:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 856 transitions. [2025-03-03 21:42:44,817 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 856 transitions. Word has length 158 [2025-03-03 21:42:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:44,817 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 856 transitions. [2025-03-03 21:42:44,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 856 transitions. [2025-03-03 21:42:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:42:44,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:44,819 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:44,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:42:44,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:44,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash 648196326, now seen corresponding path program 1 times [2025-03-03 21:42:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769755653] [2025-03-03 21:42:44,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:44,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:42:44,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:42:44,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:44,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:45,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:45,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769755653] [2025-03-03 21:42:45,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769755653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:45,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:45,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:42:45,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786801201] [2025-03-03 21:42:45,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:45,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:42:45,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:45,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:42:45,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:42:45,109 INFO L87 Difference]: Start difference. First operand 593 states and 856 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:45,223 INFO L93 Difference]: Finished difference Result 1109 states and 1613 transitions. [2025-03-03 21:42:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:42:45,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2025-03-03 21:42:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:45,226 INFO L225 Difference]: With dead ends: 1109 [2025-03-03 21:42:45,226 INFO L226 Difference]: Without dead ends: 635 [2025-03-03 21:42:45,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:42:45,228 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 127 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:45,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 515 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:42:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-03 21:42:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 593. [2025-03-03 21:42:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 459 states have (on average 1.3246187363834423) internal successors, (608), 465 states have internal predecessors, (608), 120 states have call successors, (120), 13 states have call predecessors, (120), 13 states have return successors, (120), 114 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 21:42:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 848 transitions. [2025-03-03 21:42:45,294 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 848 transitions. Word has length 158 [2025-03-03 21:42:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:45,295 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 848 transitions. [2025-03-03 21:42:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 848 transitions. [2025-03-03 21:42:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:42:45,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:45,297 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:45,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:42:45,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:45,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash -536842113, now seen corresponding path program 1 times [2025-03-03 21:42:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51713239] [2025-03-03 21:42:45,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:45,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:42:45,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:42:45,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:45,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:42:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864783503] [2025-03-03 21:42:45,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:45,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:42:45,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:42:45,371 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:42:45,373 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:42:45,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:42:45,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:42:45,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:45,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:42:45,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:42:45,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:42:45,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:42:45,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:45,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:42:45,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:42:45,850 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:42:45,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:42:45,859 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:42:46,052 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,SelfDestructingSolverStorable7 [2025-03-03 21:42:46,055 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:42:46,143 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:42:46,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:42:46 BoogieIcfgContainer [2025-03-03 21:42:46,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:42:46,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:42:46,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:42:46,150 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:42:46,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:39" (3/4) ... [2025-03-03 21:42:46,152 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:42:46,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:42:46,153 INFO L158 Benchmark]: Toolchain (without parser) took 7058.73ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.1MB in the beginning and 199.9MB in the end (delta: -94.8MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2025-03-03 21:42:46,154 INFO L158 Benchmark]: CDTParser took 0.21ms. 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:42:46,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.41ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 89.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:42:46,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.88ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.7MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:42:46,154 INFO L158 Benchmark]: Boogie Preprocessor took 53.58ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 76.7MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:42:46,154 INFO L158 Benchmark]: IcfgBuilder took 528.33ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 46.3MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 21:42:46,154 INFO L158 Benchmark]: TraceAbstraction took 6227.98ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 45.2MB in the beginning and 200.0MB in the end (delta: -154.8MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2025-03-03 21:42:46,154 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 318.8MB. Free memory was 200.0MB in the beginning and 199.9MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:42:46,155 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.41ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 89.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.88ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.7MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.58ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 76.7MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 528.33ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 46.3MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6227.98ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 45.2MB in the beginning and 200.0MB in the end (delta: -154.8MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 318.8MB. Free memory was 200.0MB in the beginning and 199.9MB in the end (delta: 97.0kB). 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 58, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 163, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of bitwiseOr at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] float var_1_28 = 3.5; [L44] signed short int var_1_29 = -8; [L45] signed char var_1_31 = -32; [L46] signed char var_1_32 = 2; [L47] signed long int var_1_34 = -4; [L48] double var_1_38 = 0.5; [L49] unsigned long int last_1_var_1_1 = 64; [L50] unsigned char last_1_var_1_11 = 50; VAL [isInitial=0, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_1 = var_1_1 [L175] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=1, var_1_8=0, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=1, var_1_8=0, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=1, var_1_8=0, var_1_9=0] [L142] var_1_7 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_8=0, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L145] var_1_9 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0] [L146] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L148] var_1_10 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L151] var_1_12 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L154] var_1_13 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L160] var_1_17 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] 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_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L163] 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_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L54] COND FALSE !((~ (var_1_5 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L57] COND TRUE var_1_12 > var_1_16 [L58] var_1_28 = ((((4.2f) < (1.25f)) ? (4.2f) : (1.25f))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L60] COND TRUE (~ (5 + var_1_16)) >= 10000u [L61] var_1_29 = (((((var_1_13 + var_1_12)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((var_1_13 + var_1_12)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L65] var_1_31 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L66] EXPR var_1_1 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L66] EXPR ((var_1_13) < ((var_1_1 | -5))) ? (var_1_13) : ((var_1_1 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L66] COND FALSE !(var_1_11 <= ((((var_1_13) < ((var_1_1 | -5))) ? (var_1_13) : ((var_1_1 | -5))))) [L71] COND TRUE ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) <= var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L72] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L88] var_1_38 = var_1_19 [L89] signed long int stepLocal_1 = last_1_var_1_11; [L90] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=2, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L91] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=2, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L92] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=2, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L96] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=2, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L97] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=2, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L97] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L98] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L109] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=2, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L111] COND FALSE !(! (var_1_11 >= var_1_11)) [L118] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L120] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L125] COND FALSE !(\read(var_1_10)) [L128] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L130] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L131] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L178] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L178-L179] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=50, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225599, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1268 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1268 mSDsluCounter, 3005 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2017 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1251 IncrementalHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 988 mSDtfsCounter, 1251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=593occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 661 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1570 NumberOfCodeBlocks, 1570 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1242 ConstructedInterpolants, 0 QuantifiedInterpolants, 3598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 7350/7392 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:42:46,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-74.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 ef09520730e82204e9b1168e46fbb148d498860060e48e36c72de6a0ddbbcce2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:42:47,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:42:48,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:42:48,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:42:48,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:42:48,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:42:48,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:42:48,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:42:48,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:42:48,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:42:48,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:42:48,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:42:48,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:42:48,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:42:48,042 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:42:48,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:42:48,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:42:48,042 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:42:48,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:42:48,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:42:48,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:42:48,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:42:48,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:42:48,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:42:48,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:42:48,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:42:48,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:42:48,045 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 -> ef09520730e82204e9b1168e46fbb148d498860060e48e36c72de6a0ddbbcce2 [2025-03-03 21:42:48,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:42:48,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:42:48,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:42:48,263 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:42:48,264 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:42:48,264 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-ps-ci_file-74.i [2025-03-03 21:42:49,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00849981/a8f80215078b4513aad95376b132b233/FLAG141104f6c [2025-03-03 21:42:49,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:42:49,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-74.i [2025-03-03 21:42:49,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00849981/a8f80215078b4513aad95376b132b233/FLAG141104f6c [2025-03-03 21:42:49,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00849981/a8f80215078b4513aad95376b132b233 [2025-03-03 21:42:49,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:42:49,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:42:49,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:42:49,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:42:49,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:42:49,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ba5ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49, skipping insertion in model container [2025-03-03 21:42:49,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:42:50,045 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-ps-ci_file-74.i[919,932] [2025-03-03 21:42:50,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:42:50,101 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:42:50,108 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-ps-ci_file-74.i[919,932] [2025-03-03 21:42:50,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:42:50,146 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:42:50,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50 WrapperNode [2025-03-03 21:42:50,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:42:50,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:42:50,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:42:50,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:42:50,153 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:42:50" (1/1) ... [2025-03-03 21:42:50,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:42:50" (1/1) ... [2025-03-03 21:42:50,190 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-03-03 21:42:50,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:42:50,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:42:50,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:42:50,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:42:50,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,224 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:42:50,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,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:42:50" (1/1) ... [2025-03-03 21:42:50,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:42:50,254 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:42:50,254 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:42:50,254 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:42:50,255 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (1/1) ... [2025-03-03 21:42:50,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:42:50,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:42:50,282 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:42:50,286 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:42:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:42:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:42:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:42:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:42:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:42:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:42:50,358 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:42:50,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:42:53,426 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 21:42:53,426 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:42:53,437 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:42:53,437 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:42:53,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:53 BoogieIcfgContainer [2025-03-03 21:42:53,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:42:53,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:42:53,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:42:53,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:42:53,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:42:49" (1/3) ... [2025-03-03 21:42:53,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd18782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:53, skipping insertion in model container [2025-03-03 21:42:53,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50" (2/3) ... [2025-03-03 21:42:53,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd18782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:53, skipping insertion in model container [2025-03-03 21:42:53,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:53" (3/3) ... [2025-03-03 21:42:53,447 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-74.i [2025-03-03 21:42:53,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:42:53,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-74.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:42:53,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:42:53,510 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;@2c7e527e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:42:53,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:42:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:42:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 21:42:53,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:53,524 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:53,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:53,530 INFO L85 PathProgramCache]: Analyzing trace with hash -145528256, now seen corresponding path program 1 times [2025-03-03 21:42:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:42:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141161939] [2025-03-03 21:42:53,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:53,540 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:42:53,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:42:53,543 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:42:53,544 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:42:53,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 21:42:53,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 21:42:53,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:53,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:53,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:42:53,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:42:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 21:42:53,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:42:53,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:42:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141161939] [2025-03-03 21:42:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141161939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:53,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:53,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:42:53,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030468442] [2025-03-03 21:42:53,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:53,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:42:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:42:53,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:42:53,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:42:53,939 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:42:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:53,958 INFO L93 Difference]: Finished difference Result 153 states and 265 transitions. [2025-03-03 21:42:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:42:53,959 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-03-03 21:42:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:53,963 INFO L225 Difference]: With dead ends: 153 [2025-03-03 21:42:53,963 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 21:42:53,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:42:53,967 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:42:53,967 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:42:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 21:42:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-03 21:42:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:42:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2025-03-03 21:42:53,997 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 149 [2025-03-03 21:42:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:53,998 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2025-03-03 21:42:53,999 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:42:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2025-03-03 21:42:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 21:42:54,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:54,002 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:54,014 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:42:54,203 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:42:54,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:54,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash -426469095, now seen corresponding path program 1 times [2025-03-03 21:42:54,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:42:54,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095135162] [2025-03-03 21:42:54,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:54,204 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:42:54,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:42:54,206 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:42:54,208 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:42:54,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 21:42:54,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 21:42:54,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:54,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:54,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 21:42:54,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:42:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-03 21:42:55,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:42:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:42:56,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:42:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095135162] [2025-03-03 21:42:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095135162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:42:56,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:42:56,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2025-03-03 21:42:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851329513] [2025-03-03 21:42:56,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:42:56,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:42:56,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:42:56,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:42:56,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:42:56,437 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 14 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 6 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2025-03-03 21:42:59,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:01,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:03,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:04,001 INFO L93 Difference]: Finished difference Result 324 states and 478 transitions. [2025-03-03 21:43:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:43:04,002 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 6 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) Word has length 149 [2025-03-03 21:43:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:04,004 INFO L225 Difference]: With dead ends: 324 [2025-03-03 21:43:04,005 INFO L226 Difference]: Without dead ends: 251 [2025-03-03 21:43:04,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:43:04,006 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 275 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:04,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 300 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-03 21:43:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-03 21:43:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 166. [2025-03-03 21:43:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 107 states have internal predecessors, (135), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:43:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 243 transitions. [2025-03-03 21:43:04,033 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 243 transitions. Word has length 149 [2025-03-03 21:43:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:04,034 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 243 transitions. [2025-03-03 21:43:04,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 6 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2025-03-03 21:43:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2025-03-03 21:43:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 21:43:04,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:04,036 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:04,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:43:04,236 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:43:04,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:04,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash -417345029, now seen corresponding path program 1 times [2025-03-03 21:43:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759968224] [2025-03-03 21:43:04,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:04,238 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:43:04,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:04,240 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:43:04,241 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:43:04,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 21:43:04,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 21:43:04,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:04,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:04,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:43:04,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:43:05,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:43:05,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:05,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759968224] [2025-03-03 21:43:05,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759968224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:05,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:05,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:43:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186680742] [2025-03-03 21:43:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:05,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:43:05,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:05,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:43:05,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:43:05,634 INFO L87 Difference]: Start difference. First operand 166 states and 243 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:43:08,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:10,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:10,165 INFO L93 Difference]: Finished difference Result 300 states and 444 transitions. [2025-03-03 21:43:10,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:43:10,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-03 21:43:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:10,189 INFO L225 Difference]: With dead ends: 300 [2025-03-03 21:43:10,189 INFO L226 Difference]: Without dead ends: 197 [2025-03-03 21:43:10,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:43:10,190 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 78 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:10,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 356 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 21:43:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-03 21:43:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 168. [2025-03-03 21:43:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 109 states have internal predecessors, (137), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:43:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 245 transitions. [2025-03-03 21:43:10,208 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 245 transitions. Word has length 149 [2025-03-03 21:43:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:10,208 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 245 transitions. [2025-03-03 21:43:10,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:43:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 245 transitions. [2025-03-03 21:43:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:43:10,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:10,210 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:10,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 21:43:10,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:43:10,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:10,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1021163356, now seen corresponding path program 1 times [2025-03-03 21:43:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:10,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653966043] [2025-03-03 21:43:10,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:10,415 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:43:10,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:10,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:43:10,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 21:43:10,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:43:10,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:43:10,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:10,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:10,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:43:10,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:43:11,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:43:11,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653966043] [2025-03-03 21:43:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653966043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:43:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966312358] [2025-03-03 21:43:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:11,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:43:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:11,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:43:11,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:43:11,239 INFO L87 Difference]: Start difference. First operand 168 states and 245 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:43:13,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:15,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:15,991 INFO L93 Difference]: Finished difference Result 300 states and 443 transitions. [2025-03-03 21:43:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:43:16,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:43:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:16,013 INFO L225 Difference]: With dead ends: 300 [2025-03-03 21:43:16,013 INFO L226 Difference]: Without dead ends: 197 [2025-03-03 21:43:16,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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:43:16,014 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 76 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:16,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 357 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 21:43:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-03 21:43:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2025-03-03 21:43:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 109 states have (on average 1.2660550458715596) internal successors, (138), 110 states have internal predecessors, (138), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:43:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 246 transitions. [2025-03-03 21:43:16,031 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 246 transitions. Word has length 150 [2025-03-03 21:43:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:16,032 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 246 transitions. [2025-03-03 21:43:16,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:43:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 246 transitions. [2025-03-03 21:43:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:43:16,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:16,037 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:16,050 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 (5)] Ended with exit code 0 [2025-03-03 21:43:16,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:43:16,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -892080637, now seen corresponding path program 1 times [2025-03-03 21:43:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:16,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491698533] [2025-03-03 21:43:16,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:16,238 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:43:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:16,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:43:16,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 21:43:16,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:43:16,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:43:16,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:16,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:16,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:43:16,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-03 21:43:17,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:43:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:43:17,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491698533] [2025-03-03 21:43:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491698533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:43:17,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:43:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-03-03 21:43:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300826472] [2025-03-03 21:43:17,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:43:17,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:43:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:17,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:43:17,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:43:17,534 INFO L87 Difference]: Start difference. First operand 169 states and 246 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-03 21:43:20,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:22,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:23,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:43:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:24,312 INFO L93 Difference]: Finished difference Result 303 states and 440 transitions. [2025-03-03 21:43:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:43:24,314 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2025-03-03 21:43:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:24,316 INFO L225 Difference]: With dead ends: 303 [2025-03-03 21:43:24,316 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 21:43:24,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-03-03 21:43:24,317 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 208 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:24,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 459 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-03 21:43:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 21:43:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 177. [2025-03-03 21:43:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:43:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2025-03-03 21:43:24,339 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 150 [2025-03-03 21:43:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:24,339 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2025-03-03 21:43:24,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-03 21:43:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2025-03-03 21:43:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:43:24,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:24,340 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:24,355 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 (6)] Ended with exit code 0 [2025-03-03 21:43:24,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:43:24,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:24,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:24,542 INFO L85 PathProgramCache]: Analyzing trace with hash -891157116, now seen corresponding path program 1 times [2025-03-03 21:43:24,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:24,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731534948] [2025-03-03 21:43:24,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:24,542 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:43:24,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:24,544 INFO L229 MonitoredProcess]: Starting monitored process 7 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:43:24,545 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 (7)] Waiting until timeout for monitored process [2025-03-03 21:43:24,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:43:24,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:43:24,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:24,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:24,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 21:43:24,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:44:09,899 WARN L286 SmtUtils]: Spent 15.48s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)