./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.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 f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:01:49,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:01:49,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:01:49,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:01:49,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:01:49,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:01:49,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:01:49,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:01:49,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:01:49,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:01:49,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:01:49,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:01:49,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:01:49,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:01:49,290 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:01:49,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:01:49,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:01:49,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:01:49,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:01:49,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:01:49,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:01:49,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:01:49,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:01:49,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:01:49,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:01:49,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:01:49,293 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 -> f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 [2025-03-17 00:01:49,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:01:49,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:01:49,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:01:49,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:01:49,569 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:01:49,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-17 00:01:50,810 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c9d579fa/2a53a212584c468083761f71cbd2f45e/FLAG49fd6314d [2025-03-17 00:01:51,059 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:01:51,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-17 00:01:51,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c9d579fa/2a53a212584c468083761f71cbd2f45e/FLAG49fd6314d [2025-03-17 00:01:51,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c9d579fa/2a53a212584c468083761f71cbd2f45e [2025-03-17 00:01:51,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:01:51,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:01:51,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:01:51,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:01:51,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:01:51,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51, skipping insertion in model container [2025-03-17 00:01:51,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:01:51,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2025-03-17 00:01:51,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:01:51,601 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:01:51,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2025-03-17 00:01:51,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:01:51,667 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:01:51,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51 WrapperNode [2025-03-17 00:01:51,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:01:51,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:01:51,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:01:51,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:01:51,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,723 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 254 [2025-03-17 00:01:51,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:01:51,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:01:51,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:01:51,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:01:51,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,767 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-17 00:01:51,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:01:51,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:01:51,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:01:51,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:01:51,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (1/1) ... [2025-03-17 00:01:51,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:01:51,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:51,825 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-17 00:01:51,827 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-17 00:01:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:01:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:01:51,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:01:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:01:51,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:01:51,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:01:51,906 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:01:51,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:01:52,331 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~ite25#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1;havoc property_#t~ite28#1;havoc property_#t~bitwise27#1;havoc property_#t~short29#1; [2025-03-17 00:01:52,357 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 00:01:52,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:01:52,373 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:01:52,373 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:01:52,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:01:52 BoogieIcfgContainer [2025-03-17 00:01:52,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:01:52,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:01:52,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:01:52,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:01:52,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:01:51" (1/3) ... [2025-03-17 00:01:52,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0d8963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:01:52, skipping insertion in model container [2025-03-17 00:01:52,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:51" (2/3) ... [2025-03-17 00:01:52,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0d8963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:01:52, skipping insertion in model container [2025-03-17 00:01:52,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:01:52" (3/3) ... [2025-03-17 00:01:52,382 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-17 00:01:52,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:01:52,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:01:52,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:01:52,445 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;@8ccd414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:01:52,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:01:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 00:01:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 00:01:52,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:52,459 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:52,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:52,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1304313786, now seen corresponding path program 1 times [2025-03-17 00:01:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453499300] [2025-03-17 00:01:52,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:52,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 00:01:52,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 00:01:52,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:52,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-17 00:01:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453499300] [2025-03-17 00:01:52,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453499300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:52,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688581496] [2025-03-17 00:01:52,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:52,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:52,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:52,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:52,804 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-17 00:01:52,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 00:01:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 00:01:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:52,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:01:52,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-17 00:01:52,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:01:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688581496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:52,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:01:52,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:01:52,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828557958] [2025-03-17 00:01:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:52,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:01:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:52,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:01:52,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:01:53,002 INFO L87 Difference]: Start difference. First operand has 103 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 00:01:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:53,035 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2025-03-17 00:01:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:01:53,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 182 [2025-03-17 00:01:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:53,043 INFO L225 Difference]: With dead ends: 203 [2025-03-17 00:01:53,045 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 00:01:53,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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-17 00:01:53,052 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:53,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:01:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 00:01:53,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 00:01:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 00:01:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2025-03-17 00:01:53,088 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 182 [2025-03-17 00:01:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2025-03-17 00:01:53,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 00:01:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2025-03-17 00:01:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 00:01:53,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:53,092 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:53,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:01:53,293 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-17 00:01:53,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:53,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1648897155, now seen corresponding path program 1 times [2025-03-17 00:01:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:53,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8271972] [2025-03-17 00:01:53,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:53,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 00:01:53,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 00:01:53,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:53,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:01:53,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8271972] [2025-03-17 00:01:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8271972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:53,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:01:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103616248] [2025-03-17 00:01:53,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:53,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:01:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:53,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:01:53,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:01:53,568 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:53,640 INFO L93 Difference]: Finished difference Result 287 states and 443 transitions. [2025-03-17 00:01:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:01:53,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2025-03-17 00:01:53,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:53,646 INFO L225 Difference]: With dead ends: 287 [2025-03-17 00:01:53,647 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 00:01:53,647 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-17 00:01:53,649 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 143 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:53,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 382 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:01:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 00:01:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 122. [2025-03-17 00:01:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 00:01:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 185 transitions. [2025-03-17 00:01:53,668 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 185 transitions. Word has length 182 [2025-03-17 00:01:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:53,670 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 185 transitions. [2025-03-17 00:01:53,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 185 transitions. [2025-03-17 00:01:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 00:01:53,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:53,672 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:53,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:01:53,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:53,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:53,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1138518332, now seen corresponding path program 1 times [2025-03-17 00:01:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:53,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310383464] [2025-03-17 00:01:53,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:53,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 00:01:53,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 00:01:53,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:53,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:01:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:54,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310383464] [2025-03-17 00:01:54,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310383464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:54,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:01:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977308892] [2025-03-17 00:01:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:54,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:01:54,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:54,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:01:54,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:01:54,141 INFO L87 Difference]: Start difference. First operand 122 states and 185 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:54,501 INFO L93 Difference]: Finished difference Result 416 states and 636 transitions. [2025-03-17 00:01:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:01:54,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2025-03-17 00:01:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:54,505 INFO L225 Difference]: With dead ends: 416 [2025-03-17 00:01:54,505 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 00:01:54,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-17 00:01:54,510 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 179 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:54,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 652 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:01:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 00:01:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 235. [2025-03-17 00:01:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 00:01:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 356 transitions. [2025-03-17 00:01:54,539 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 356 transitions. Word has length 182 [2025-03-17 00:01:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:54,540 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 356 transitions. [2025-03-17 00:01:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 356 transitions. [2025-03-17 00:01:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 00:01:54,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:54,546 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:54,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:01:54,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:54,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash 438483181, now seen corresponding path program 1 times [2025-03-17 00:01:54,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:54,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599097893] [2025-03-17 00:01:54,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:54,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:54,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 00:01:54,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 00:01:54,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:54,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:01:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599097893] [2025-03-17 00:01:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599097893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:01:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629117691] [2025-03-17 00:01:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:54,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:01:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:54,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:01:54,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:01:54,991 INFO L87 Difference]: Start difference. First operand 235 states and 356 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:55,413 INFO L93 Difference]: Finished difference Result 616 states and 925 transitions. [2025-03-17 00:01:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:01:55,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2025-03-17 00:01:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:55,419 INFO L225 Difference]: With dead ends: 616 [2025-03-17 00:01:55,420 INFO L226 Difference]: Without dead ends: 382 [2025-03-17 00:01:55,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:01:55,423 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 149 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:55,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 645 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:01:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-17 00:01:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 354. [2025-03-17 00:01:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 263 states have internal predecessors, (357), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:01:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 531 transitions. [2025-03-17 00:01:55,467 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 531 transitions. Word has length 183 [2025-03-17 00:01:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:55,467 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 531 transitions. [2025-03-17 00:01:55,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 531 transitions. [2025-03-17 00:01:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 00:01:55,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:55,469 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:55,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:01:55,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:55,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1219962786, now seen corresponding path program 1 times [2025-03-17 00:01:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027906421] [2025-03-17 00:01:55,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:55,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 00:01:55,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 00:01:55,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:55,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:01:55,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027906421] [2025-03-17 00:01:55,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027906421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:55,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:55,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:01:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483552443] [2025-03-17 00:01:55,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:55,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:01:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:55,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:01:55,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:01:55,684 INFO L87 Difference]: Start difference. First operand 354 states and 531 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:55,728 INFO L93 Difference]: Finished difference Result 708 states and 1063 transitions. [2025-03-17 00:01:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:01:55,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2025-03-17 00:01:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:55,732 INFO L225 Difference]: With dead ends: 708 [2025-03-17 00:01:55,732 INFO L226 Difference]: Without dead ends: 355 [2025-03-17 00:01:55,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:01:55,737 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:55,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:01:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-17 00:01:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-17 00:01:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 264 states have (on average 1.3484848484848484) internal successors, (356), 264 states have internal predecessors, (356), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:01:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 530 transitions. [2025-03-17 00:01:55,772 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 530 transitions. Word has length 184 [2025-03-17 00:01:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:55,772 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 530 transitions. [2025-03-17 00:01:55,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 530 transitions. [2025-03-17 00:01:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 00:01:55,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:55,774 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:55,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:01:55,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash 926559779, now seen corresponding path program 1 times [2025-03-17 00:01:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300059388] [2025-03-17 00:01:55,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:55,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 00:01:55,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 00:01:55,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:55,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:01:55,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300059388] [2025-03-17 00:01:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300059388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:55,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:55,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:01:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597866148] [2025-03-17 00:01:55,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:55,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:01:55,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:55,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:01:55,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:01:55,988 INFO L87 Difference]: Start difference. First operand 355 states and 530 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:56,360 INFO L93 Difference]: Finished difference Result 636 states and 956 transitions. [2025-03-17 00:01:56,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:01:56,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2025-03-17 00:01:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:56,365 INFO L225 Difference]: With dead ends: 636 [2025-03-17 00:01:56,365 INFO L226 Difference]: Without dead ends: 514 [2025-03-17 00:01:56,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-17 00:01:56,366 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 253 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:56,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 903 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:01:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-17 00:01:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 362. [2025-03-17 00:01:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 271 states have (on average 1.3505535055350553) internal successors, (366), 271 states have internal predecessors, (366), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:01:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 540 transitions. [2025-03-17 00:01:56,417 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 540 transitions. Word has length 184 [2025-03-17 00:01:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 540 transitions. [2025-03-17 00:01:56,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 540 transitions. [2025-03-17 00:01:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 00:01:56,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:56,420 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:56,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:01:56,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:56,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash -137980884, now seen corresponding path program 1 times [2025-03-17 00:01:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:56,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834087714] [2025-03-17 00:01:56,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:56,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 00:01:56,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 00:01:56,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:56,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:01:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834087714] [2025-03-17 00:01:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834087714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:56,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:01:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125966436] [2025-03-17 00:01:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:56,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:01:56,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:56,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:01:56,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:01:56,855 INFO L87 Difference]: Start difference. First operand 362 states and 540 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:56,958 INFO L93 Difference]: Finished difference Result 781 states and 1170 transitions. [2025-03-17 00:01:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:01:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2025-03-17 00:01:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:56,961 INFO L225 Difference]: With dead ends: 781 [2025-03-17 00:01:56,961 INFO L226 Difference]: Without dead ends: 420 [2025-03-17 00:01:56,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-17 00:01:56,963 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 131 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:56,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 573 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:01:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-17 00:01:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 362. [2025-03-17 00:01:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 271 states have (on average 1.3210332103321034) internal successors, (358), 271 states have internal predecessors, (358), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:01:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 532 transitions. [2025-03-17 00:01:57,019 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 532 transitions. Word has length 184 [2025-03-17 00:01:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:57,021 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 532 transitions. [2025-03-17 00:01:57,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 532 transitions. [2025-03-17 00:01:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 00:01:57,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:57,023 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:57,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:01:57,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:57,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash -839431873, now seen corresponding path program 1 times [2025-03-17 00:01:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609068438] [2025-03-17 00:01:57,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:57,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 00:01:57,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 00:01:57,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:57,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:01:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:57,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609068438] [2025-03-17 00:01:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609068438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:01:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023300008] [2025-03-17 00:01:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:57,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:01:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:57,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:01:57,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:01:57,239 INFO L87 Difference]: Start difference. First operand 362 states and 532 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:57,823 INFO L93 Difference]: Finished difference Result 1207 states and 1757 transitions. [2025-03-17 00:01:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:01:57,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2025-03-17 00:01:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:57,832 INFO L225 Difference]: With dead ends: 1207 [2025-03-17 00:01:57,832 INFO L226 Difference]: Without dead ends: 846 [2025-03-17 00:01:57,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:01:57,833 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 328 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:57,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 642 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:01:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-17 00:01:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 627. [2025-03-17 00:01:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 476 states have (on average 1.2983193277310925) internal successors, (618), 476 states have internal predecessors, (618), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-17 00:01:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 908 transitions. [2025-03-17 00:01:57,958 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 908 transitions. Word has length 188 [2025-03-17 00:01:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:57,958 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 908 transitions. [2025-03-17 00:01:57,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:01:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 908 transitions. [2025-03-17 00:01:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 00:01:57,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:57,960 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:57,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:01:57,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:57,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1276531737, now seen corresponding path program 1 times [2025-03-17 00:01:57,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:57,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479575918] [2025-03-17 00:01:57,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:57,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 00:01:58,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 00:01:58,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:58,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:02:03,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:03,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479575918] [2025-03-17 00:02:03,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479575918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:03,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:03,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:02:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160259222] [2025-03-17 00:02:03,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:03,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:02:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:03,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:02:03,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:02:03,153 INFO L87 Difference]: Start difference. First operand 627 states and 908 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:02:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:05,032 INFO L93 Difference]: Finished difference Result 1312 states and 1843 transitions. [2025-03-17 00:02:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:02:05,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2025-03-17 00:02:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:05,038 INFO L225 Difference]: With dead ends: 1312 [2025-03-17 00:02:05,038 INFO L226 Difference]: Without dead ends: 1070 [2025-03-17 00:02:05,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:02:05,040 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 162 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:05,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 828 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:02:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-17 00:02:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 997. [2025-03-17 00:02:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 831 states have (on average 1.3032490974729243) internal successors, (1083), 836 states have internal predecessors, (1083), 155 states have call successors, (155), 10 states have call predecessors, (155), 10 states have return successors, (155), 150 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-17 00:02:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1393 transitions. [2025-03-17 00:02:05,148 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1393 transitions. Word has length 188 [2025-03-17 00:02:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:05,148 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1393 transitions. [2025-03-17 00:02:05,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:02:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1393 transitions. [2025-03-17 00:02:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 00:02:05,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:05,150 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:05,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:02:05,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:05,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash -31767256, now seen corresponding path program 1 times [2025-03-17 00:02:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574349328] [2025-03-17 00:02:05,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:05,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 00:02:05,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 00:02:05,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:05,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:02:05,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 00:02:05,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 00:02:05,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 00:02:05,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:05,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:02:05,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 00:02:05,305 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 00:02:05,305 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 00:02:05,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:02:05,309 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:05,417 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 00:02:05,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:02:05 BoogieIcfgContainer [2025-03-17 00:02:05,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 00:02:05,421 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 00:02:05,421 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 00:02:05,422 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 00:02:05,422 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:01:52" (3/4) ... [2025-03-17 00:02:05,424 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 00:02:05,424 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 00:02:05,425 INFO L158 Benchmark]: Toolchain (without parser) took 14059.31ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 111.9MB in the beginning and 240.9MB in the end (delta: -129.0MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-03-17 00:02:05,426 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:02:05,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.23ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 96.6MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 00:02:05,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.05ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:02:05,427 INFO L158 Benchmark]: Boogie Preprocessor took 69.99ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 87.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 00:02:05,427 INFO L158 Benchmark]: IcfgBuilder took 578.90ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 56.1MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 00:02:05,427 INFO L158 Benchmark]: TraceAbstraction took 13045.48ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 55.6MB in the beginning and 241.0MB in the end (delta: -185.4MB). Peak memory consumption was 868.9kB. Max. memory is 16.1GB. [2025-03-17 00:02:05,427 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 335.5MB. Free memory was 241.0MB in the beginning and 240.9MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:02:05,429 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.28ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.23ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 96.6MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.05ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.99ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 87.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 578.90ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 56.1MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13045.48ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 55.6MB in the beginning and 241.0MB in the end (delta: -185.4MB). Peak memory consumption was 868.9kB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 335.5MB. Free memory was 241.0MB in the beginning and 240.9MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned char var_1_25 = 1; [L41] signed char var_1_26 = 50; [L42] signed char var_1_27 = 4; [L43] signed char var_1_28 = -10; [L44] signed char var_1_29 = -64; [L45] signed char var_1_30 = -8; [L46] signed long int var_1_31 = 1; [L47] float var_1_32 = 3.75; [L48] float var_1_33 = 8.5; [L49] unsigned char var_1_34 = 0; [L50] unsigned char var_1_35 = 8; [L51] unsigned short int var_1_36 = 5; [L52] signed long int last_1_var_1_5 = 5; [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L162] last_1_var_1_5 = var_1_5 [L172] RET updateLastVariables() [L173] CALL updateVariables() [L115] var_1_9 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L117] var_1_10 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L118] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L122] var_1_12 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L123] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L125] var_1_13 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L126] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L128] var_1_14 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L131] var_1_18 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L132] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L134] var_1_19 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L135] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L140] var_1_25 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L143] var_1_26 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L146] var_1_27 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L149] var_1_28 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L152] var_1_30 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L155] var_1_33 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L157] var_1_35 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L173] RET updateVariables() [L174] CALL step() [L56] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L61] var_1_29 = var_1_30 [L62] var_1_31 = var_1_29 [L63] var_1_32 = var_1_33 [L64] var_1_34 = var_1_35 [L65] var_1_36 = var_1_35 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L66] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L69] var_1_20 = var_1_8 [L70] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L71] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L74] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L75] COND FALSE !(\read(var_1_22)) [L82] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L84] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L85] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L86] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L87] COND FALSE !(\read(var_1_22)) [L94] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L99] signed long int stepLocal_4 = 256; [L100] unsigned char stepLocal_3 = var_1_22; [L101] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L102] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L105] COND FALSE !(stepLocal_3 || var_1_22) [L110] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165-L166] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 189 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1345 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1345 mSDsluCounter, 5071 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3208 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1400 IncrementalHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 1863 mSDtfsCounter, 1400 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 655 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2027 NumberOfCodeBlocks, 2027 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1829 ConstructedInterpolants, 0 QuantifiedInterpolants, 11281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 16184/16240 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-17 00:02:05,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.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 f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:02:07,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:02:07,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 00:02:07,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:02:07,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:02:07,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:02:07,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:02:07,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:02:07,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:02:07,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:02:07,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:02:07,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:02:07,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:02:07,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:02:07,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:02:07,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:07,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:02:07,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:02:07,679 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 -> f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 [2025-03-17 00:02:07,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:02:07,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:02:07,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:02:07,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:02:07,989 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:02:07,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-17 00:02:09,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1c69882/32f963866974437c8c8b93f765e8200d/FLAGb3c754a5d [2025-03-17 00:02:09,390 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:02:09,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-17 00:02:09,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1c69882/32f963866974437c8c8b93f765e8200d/FLAGb3c754a5d [2025-03-17 00:02:09,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1c69882/32f963866974437c8c8b93f765e8200d [2025-03-17 00:02:09,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:02:09,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:02:09,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:09,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:02:09,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:02:09,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88a877f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09, skipping insertion in model container [2025-03-17 00:02:09,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:02:09,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2025-03-17 00:02:09,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:09,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:02:09,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2025-03-17 00:02:09,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:09,709 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:02:09,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09 WrapperNode [2025-03-17 00:02:09,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:09,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:09,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:02:09,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:02:09,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,759 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-17 00:02:09,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:09,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:02:09,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:02:09,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:02:09,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,791 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-17 00:02:09,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:02:09,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:02:09,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:02:09,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:02:09,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (1/1) ... [2025-03-17 00:02:09,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:09,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:09,850 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-17 00:02:09,853 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-17 00:02:09,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:02:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 00:02:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:02:09,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:02:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:02:09,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:02:09,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:02:09,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:02:10,241 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 00:02:10,241 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:02:10,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:02:10,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:02:10,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:10 BoogieIcfgContainer [2025-03-17 00:02:10,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:02:10,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:02:10,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:02:10,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:02:10,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:02:09" (1/3) ... [2025-03-17 00:02:10,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5ef995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:10, skipping insertion in model container [2025-03-17 00:02:10,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:09" (2/3) ... [2025-03-17 00:02:10,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5ef995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:10, skipping insertion in model container [2025-03-17 00:02:10,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:10" (3/3) ... [2025-03-17 00:02:10,259 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2025-03-17 00:02:10,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:02:10,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:02:10,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:02:10,323 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;@b91bbdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:02:10,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:02:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 00:02:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 00:02:10,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:10,338 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:10,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -548052205, now seen corresponding path program 1 times [2025-03-17 00:02:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:02:10,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586277683] [2025-03-17 00:02:10,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:10,354 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-17 00:02:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:02:10,361 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-17 00:02:10,362 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-17 00:02:10,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 00:02:10,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 00:02:10,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:10,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:10,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:02:10,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-17 00:02:10,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:02:10,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:02:10,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586277683] [2025-03-17 00:02:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586277683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:10,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:02:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169428277] [2025-03-17 00:02:10,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:02:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:02:10,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:02:10,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:02:10,634 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 00:02:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:10,652 INFO L93 Difference]: Finished difference Result 147 states and 261 transitions. [2025-03-17 00:02:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:02:10,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 177 [2025-03-17 00:02:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:10,663 INFO L225 Difference]: With dead ends: 147 [2025-03-17 00:02:10,663 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 00:02:10,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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-17 00:02:10,669 INFO L435 NwaCegarLoop]: 113 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, 113 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-17 00:02:10,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 00:02:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-17 00:02:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 00:02:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2025-03-17 00:02:10,718 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 177 [2025-03-17 00:02:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:10,718 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2025-03-17 00:02:10,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 00:02:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2025-03-17 00:02:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 00:02:10,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:10,720 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:10,726 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-17 00:02:10,921 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-17 00:02:10,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:10,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 752977078, now seen corresponding path program 1 times [2025-03-17 00:02:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:02:10,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138517469] [2025-03-17 00:02:10,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:10,923 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-17 00:02:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:02:10,925 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-17 00:02:10,925 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-17 00:02:10,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 00:02:11,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 00:02:11,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:11,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 00:02:11,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 838 proven. 39 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2025-03-17 00:02:11,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-17 00:02:11,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:02:11,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138517469] [2025-03-17 00:02:11,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138517469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:11,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:02:11,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-17 00:02:11,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301690017] [2025-03-17 00:02:11,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:11,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:02:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:02:11,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:02:11,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:02:11,516 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-17 00:02:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:11,872 INFO L93 Difference]: Finished difference Result 151 states and 228 transitions. [2025-03-17 00:02:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:02:11,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 177 [2025-03-17 00:02:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:11,874 INFO L225 Difference]: With dead ends: 151 [2025-03-17 00:02:11,874 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 00:02:11,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:02:11,875 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 88 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:11,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 143 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:02:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 00:02:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2025-03-17 00:02:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 00:02:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2025-03-17 00:02:11,887 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 177 [2025-03-17 00:02:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:11,887 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2025-03-17 00:02:11,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-17 00:02:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2025-03-17 00:02:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 00:02:11,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:11,889 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:11,896 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-17 00:02:12,090 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-17 00:02:12,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:12,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 556463573, now seen corresponding path program 1 times [2025-03-17 00:02:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:02:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213261687] [2025-03-17 00:02:12,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:12,092 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-17 00:02:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:02:12,095 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-17 00:02:12,097 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-17 00:02:12,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 00:02:12,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 00:02:12,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:12,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:12,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 00:02:12,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:02:12,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:02:12,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:02:12,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213261687] [2025-03-17 00:02:12,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213261687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:12,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:12,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573908507] [2025-03-17 00:02:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:12,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:02:12,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:12,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:12,582 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:02:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:12,854 INFO L93 Difference]: Finished difference Result 208 states and 306 transitions. [2025-03-17 00:02:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:02:12,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 177 [2025-03-17 00:02:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:12,857 INFO L225 Difference]: With dead ends: 208 [2025-03-17 00:02:12,857 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 00:02:12,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:02:12,858 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 104 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:12,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 391 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:02:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 00:02:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 75. [2025-03-17 00:02:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 00:02:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2025-03-17 00:02:12,889 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 177 [2025-03-17 00:02:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:12,891 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2025-03-17 00:02:12,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:02:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2025-03-17 00:02:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 00:02:12,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:12,894 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:12,901 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-17 00:02:13,098 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-17 00:02:13,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:13,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1049465586, now seen corresponding path program 1 times [2025-03-17 00:02:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:02:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114428969] [2025-03-17 00:02:13,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:13,100 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-17 00:02:13,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:02:13,102 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-17 00:02:13,103 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-17 00:02:13,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 00:02:13,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 00:02:13,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:13,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:13,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 00:02:13,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 00:02:13,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:02:13,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:02:13,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114428969] [2025-03-17 00:02:13,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114428969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:13,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:13,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:13,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459297041] [2025-03-17 00:02:13,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:13,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:13,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:02:13,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:13,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:13,881 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:02:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:14,130 INFO L93 Difference]: Finished difference Result 229 states and 328 transitions. [2025-03-17 00:02:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:02:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 178 [2025-03-17 00:02:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:14,132 INFO L225 Difference]: With dead ends: 229 [2025-03-17 00:02:14,132 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 00:02:14,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:14,133 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 57 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:14,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 331 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:02:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 00:02:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2025-03-17 00:02:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 00:02:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2025-03-17 00:02:14,167 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 178 [2025-03-17 00:02:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:14,168 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2025-03-17 00:02:14,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 00:02:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2025-03-17 00:02:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 00:02:14,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:14,170 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:14,177 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-17 00:02:14,371 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-17 00:02:14,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:14,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1821566477, now seen corresponding path program 1 times [2025-03-17 00:02:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:02:14,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748004528] [2025-03-17 00:02:14,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:14,373 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-17 00:02:14,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:02:14,375 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-17 00:02:14,377 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-17 00:02:14,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 00:02:14,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 00:02:14,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:14,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:14,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 00:02:14,906 INFO L279 TraceCheckSpWp]: Computing forward predicates...