./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:55:23,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:55:23,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:55:23,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:55:23,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:55:23,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:55:23,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:55:23,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:55:23,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:55:23,803 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:55:23,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:55:23,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:55:23,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:55:23,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:55:23,805 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:55:23,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:55:23,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:55:23,805 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:55:23,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:55:23,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:55:23,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:55:23,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:55:23,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:55:23,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:55:23,806 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:55:23,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:55:23,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:55:23,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:55:23,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:55:23,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:55:23,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:55:23,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:55:23,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:55:23,807 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-jdk21/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 -> a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5 [2025-02-05 22:55:24,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:55:24,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:55:24,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:55:24,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:55:24,020 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:55:24,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2025-02-05 22:55:25,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66f818f42/14572d3030d44bd3a1dc8f6ef474c189/FLAGbf47d7c2e [2025-02-05 22:55:25,589 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:55:25,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2025-02-05 22:55:25,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66f818f42/14572d3030d44bd3a1dc8f6ef474c189/FLAGbf47d7c2e [2025-02-05 22:55:25,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66f818f42/14572d3030d44bd3a1dc8f6ef474c189 [2025-02-05 22:55:25,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:55:25,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:55:25,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:55:25,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:55:25,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:55:25,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:25,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25, skipping insertion in model container [2025-02-05 22:55:25,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:25,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:55:25,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931] [2025-02-05 22:55:25,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:55:25,886 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:55:25,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931] [2025-02-05 22:55:25,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:55:25,942 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:55:25,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25 WrapperNode [2025-02-05 22:55:25,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:55:25,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:55:25,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:55:25,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:55:25,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:25,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,004 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2025-02-05 22:55:26,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:55:26,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:55:26,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:55:26,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:55:26,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,040 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-02-05 22:55:26,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:55:26,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:55:26,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:55:26,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:55:26,055 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (1/1) ... [2025-02-05 22:55:26,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:55:26,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:26,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:55:26,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:55:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:55:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:55:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:55:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:55:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:55:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:55:26,144 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:55:26,145 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:55:26,561 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-02-05 22:55:26,595 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 22:55:26,596 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:55:26,629 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:55:26,633 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:55:26,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:55:26 BoogieIcfgContainer [2025-02-05 22:55:26,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:55:26,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:55:26,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:55:26,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:55:26,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:55:25" (1/3) ... [2025-02-05 22:55:26,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492beab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:55:26, skipping insertion in model container [2025-02-05 22:55:26,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:25" (2/3) ... [2025-02-05 22:55:26,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492beab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:55:26, skipping insertion in model container [2025-02-05 22:55:26,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:55:26" (3/3) ... [2025-02-05 22:55:26,649 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2025-02-05 22:55:26,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:55:26,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:55:26,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:55:26,759 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;@73f59bbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:55:26,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:55:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 80 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:55:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:55:26,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:26,780 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:26,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:26,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash 865938325, now seen corresponding path program 1 times [2025-02-05 22:55:26,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:26,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352756565] [2025-02-05 22:55:26,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:26,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:55:26,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:55:26,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:26,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 22:55:27,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:27,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352756565] [2025-02-05 22:55:27,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352756565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:27,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075029007] [2025-02-05 22:55:27,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:27,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:27,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:27,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:55:27,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:55:27,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:55:27,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:55:27,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:27,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:27,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:55:27,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 22:55:27,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075029007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:27,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:55:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:55:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267562035] [2025-02-05 22:55:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:27,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:55:27,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:27,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:55:27,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:55:27,290 INFO L87 Difference]: Start difference. First operand has 105 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 80 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:55:27,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:27,338 INFO L93 Difference]: Finished difference Result 204 states and 354 transitions. [2025-02-05 22:55:27,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:55:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 160 [2025-02-05 22:55:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:27,357 INFO L225 Difference]: With dead ends: 204 [2025-02-05 22:55:27,358 INFO L226 Difference]: Without dead ends: 102 [2025-02-05 22:55:27,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-02-05 22:55:27,363 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:27,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:55:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-05 22:55:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-05 22:55:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 77 states have internal predecessors, (116), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:55:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 162 transitions. [2025-02-05 22:55:27,420 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 162 transitions. Word has length 160 [2025-02-05 22:55:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:27,421 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 162 transitions. [2025-02-05 22:55:27,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:55:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2025-02-05 22:55:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:55:27,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:27,423 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:27,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:55:27,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:55:27,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1038700308, now seen corresponding path program 1 times [2025-02-05 22:55:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:27,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915121860] [2025-02-05 22:55:27,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:27,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:55:27,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:55:27,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:27,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:27,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915121860] [2025-02-05 22:55:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915121860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:27,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:27,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:55:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374134235] [2025-02-05 22:55:27,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:27,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:27,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:27,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:27,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:27,978 INFO L87 Difference]: Start difference. First operand 102 states and 162 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:28,053 INFO L93 Difference]: Finished difference Result 300 states and 480 transitions. [2025-02-05 22:55:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-02-05 22:55:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:28,057 INFO L225 Difference]: With dead ends: 300 [2025-02-05 22:55:28,057 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 22:55:28,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02-05 22:55:28,058 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 101 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:28,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 314 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:55:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 22:55:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-02-05 22:55:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 150 states have internal predecessors, (224), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:55:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 316 transitions. [2025-02-05 22:55:28,094 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 316 transitions. Word has length 160 [2025-02-05 22:55:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:28,094 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 316 transitions. [2025-02-05 22:55:28,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions. [2025-02-05 22:55:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 22:55:28,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:28,096 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:55:28,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1054061817, now seen corresponding path program 1 times [2025-02-05 22:55:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729686319] [2025-02-05 22:55:28,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:28,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 22:55:28,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 22:55:28,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:28,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:28,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:28,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729686319] [2025-02-05 22:55:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729686319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:55:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204903422] [2025-02-05 22:55:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:28,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:28,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:28,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:28,291 INFO L87 Difference]: Start difference. First operand 199 states and 316 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:28,362 INFO L93 Difference]: Finished difference Result 505 states and 804 transitions. [2025-02-05 22:55:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2025-02-05 22:55:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:28,368 INFO L225 Difference]: With dead ends: 505 [2025-02-05 22:55:28,369 INFO L226 Difference]: Without dead ends: 309 [2025-02-05 22:55:28,371 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-02-05 22:55:28,373 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 77 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:28,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 354 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:55:28,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-05 22:55:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 251. [2025-02-05 22:55:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 202 states have (on average 1.5148514851485149) internal successors, (306), 202 states have internal predecessors, (306), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:55:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 398 transitions. [2025-02-05 22:55:28,400 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 398 transitions. Word has length 161 [2025-02-05 22:55:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:28,401 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 398 transitions. [2025-02-05 22:55:28,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 398 transitions. [2025-02-05 22:55:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 22:55:28,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:28,406 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:28,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:55:28,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:28,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 803019931, now seen corresponding path program 1 times [2025-02-05 22:55:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:28,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747261294] [2025-02-05 22:55:28,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:28,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 22:55:28,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 22:55:28,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:28,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:28,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:28,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747261294] [2025-02-05 22:55:28,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747261294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:28,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:55:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993052818] [2025-02-05 22:55:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:28,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:28,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:28,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:28,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:28,561 INFO L87 Difference]: Start difference. First operand 251 states and 398 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:28,672 INFO L93 Difference]: Finished difference Result 719 states and 1146 transitions. [2025-02-05 22:55:28,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:28,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2025-02-05 22:55:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:28,678 INFO L225 Difference]: With dead ends: 719 [2025-02-05 22:55:28,678 INFO L226 Difference]: Without dead ends: 471 [2025-02-05 22:55:28,679 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-02-05 22:55:28,680 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 135 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:28,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 399 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:55:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-05 22:55:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2025-02-05 22:55:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 372 states have (on average 1.4838709677419355) internal successors, (552), 372 states have internal predecessors, (552), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 22:55:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 736 transitions. [2025-02-05 22:55:28,759 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 736 transitions. Word has length 161 [2025-02-05 22:55:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:28,766 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 736 transitions. [2025-02-05 22:55:28,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 736 transitions. [2025-02-05 22:55:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 22:55:28,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:28,768 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:28,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:55:28,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:28,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -308900949, now seen corresponding path program 1 times [2025-02-05 22:55:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:28,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928771181] [2025-02-05 22:55:28,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:28,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 22:55:28,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 22:55:28,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:28,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:29,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928771181] [2025-02-05 22:55:29,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928771181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:29,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:29,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:55:29,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901054538] [2025-02-05 22:55:29,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:29,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:55:29,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:29,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:55:29,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:55:29,028 INFO L87 Difference]: Start difference. First operand 469 states and 736 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:29,412 INFO L93 Difference]: Finished difference Result 1431 states and 2247 transitions. [2025-02-05 22:55:29,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:55:29,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-02-05 22:55:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:29,418 INFO L225 Difference]: With dead ends: 1431 [2025-02-05 22:55:29,419 INFO L226 Difference]: Without dead ends: 965 [2025-02-05 22:55:29,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:29,420 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 335 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:29,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 542 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:55:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-02-05 22:55:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 757. [2025-02-05 22:55:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 632 states have (on average 1.5063291139240507) internal successors, (952), 636 states have internal predecessors, (952), 116 states have call successors, (116), 8 states have call predecessors, (116), 8 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-05 22:55:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1184 transitions. [2025-02-05 22:55:29,464 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1184 transitions. Word has length 162 [2025-02-05 22:55:29,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:29,465 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1184 transitions. [2025-02-05 22:55:29,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1184 transitions. [2025-02-05 22:55:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 22:55:29,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:29,467 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:29,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:55:29,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:29,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash -523972912, now seen corresponding path program 1 times [2025-02-05 22:55:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:29,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133784429] [2025-02-05 22:55:29,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 22:55:29,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 22:55:29,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:29,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:29,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:29,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133784429] [2025-02-05 22:55:29,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133784429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:29,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:29,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:55:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985456209] [2025-02-05 22:55:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:29,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:29,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:29,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:29,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:29,626 INFO L87 Difference]: Start difference. First operand 757 states and 1184 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:29,735 INFO L93 Difference]: Finished difference Result 2108 states and 3307 transitions. [2025-02-05 22:55:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-02-05 22:55:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:29,742 INFO L225 Difference]: With dead ends: 2108 [2025-02-05 22:55:29,742 INFO L226 Difference]: Without dead ends: 1330 [2025-02-05 22:55:29,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02-05 22:55:29,744 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 102 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:29,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 279 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:55:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-05 22:55:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2025-02-05 22:55:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1110 states have (on average 1.5036036036036036) internal successors, (1669), 1117 states have internal predecessors, (1669), 203 states have call successors, (203), 14 states have call predecessors, (203), 14 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2025-02-05 22:55:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2075 transitions. [2025-02-05 22:55:29,818 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2075 transitions. Word has length 162 [2025-02-05 22:55:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:29,818 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2075 transitions. [2025-02-05 22:55:29,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2075 transitions. [2025-02-05 22:55:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 22:55:29,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:29,820 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:29,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:55:29,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:29,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1485586929, now seen corresponding path program 1 times [2025-02-05 22:55:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:29,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703264320] [2025-02-05 22:55:29,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:29,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 22:55:29,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 22:55:29,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:29,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703264320] [2025-02-05 22:55:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703264320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:55:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036893217] [2025-02-05 22:55:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:29,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:55:29,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:29,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:55:29,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:29,990 INFO L87 Difference]: Start difference. First operand 1328 states and 2075 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:30,364 INFO L93 Difference]: Finished difference Result 3162 states and 4978 transitions. [2025-02-05 22:55:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:55:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-02-05 22:55:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:30,374 INFO L225 Difference]: With dead ends: 3162 [2025-02-05 22:55:30,374 INFO L226 Difference]: Without dead ends: 2365 [2025-02-05 22:55:30,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:30,377 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 453 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:30,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 485 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:55:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-02-05 22:55:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1547. [2025-02-05 22:55:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1329 states have (on average 1.5334838224228744) internal successors, (2038), 1336 states have internal predecessors, (2038), 203 states have call successors, (203), 14 states have call predecessors, (203), 14 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2025-02-05 22:55:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2444 transitions. [2025-02-05 22:55:30,473 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2444 transitions. Word has length 162 [2025-02-05 22:55:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:30,473 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2444 transitions. [2025-02-05 22:55:30,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2444 transitions. [2025-02-05 22:55:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 22:55:30,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:30,475 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:30,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:55:30,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:30,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:30,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1552593682, now seen corresponding path program 1 times [2025-02-05 22:55:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:30,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938678403] [2025-02-05 22:55:30,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:30,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 22:55:30,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 22:55:30,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:30,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:30,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938678403] [2025-02-05 22:55:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938678403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:30,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:30,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:55:30,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512096634] [2025-02-05 22:55:30,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:30,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:55:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:30,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:55:30,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:55:30,790 INFO L87 Difference]: Start difference. First operand 1547 states and 2444 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:31,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:31,008 INFO L93 Difference]: Finished difference Result 4650 states and 7356 transitions. [2025-02-05 22:55:31,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:55:31,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-02-05 22:55:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:31,025 INFO L225 Difference]: With dead ends: 4650 [2025-02-05 22:55:31,025 INFO L226 Difference]: Without dead ends: 3106 [2025-02-05 22:55:31,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:31,031 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 101 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:31,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 429 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:55:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-02-05 22:55:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3084. [2025-02-05 22:55:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2649 states have (on average 1.5352963382408455) internal successors, (4067), 2663 states have internal predecessors, (4067), 406 states have call successors, (406), 28 states have call predecessors, (406), 28 states have return successors, (406), 392 states have call predecessors, (406), 406 states have call successors, (406) [2025-02-05 22:55:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4879 transitions. [2025-02-05 22:55:31,188 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4879 transitions. Word has length 162 [2025-02-05 22:55:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:31,191 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 4879 transitions. [2025-02-05 22:55:31,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4879 transitions. [2025-02-05 22:55:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 22:55:31,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:31,194 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:31,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:55:31,194 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:31,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1321623292, now seen corresponding path program 1 times [2025-02-05 22:55:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715588402] [2025-02-05 22:55:31,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:31,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:55:31,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:55:31,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:31,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715588402] [2025-02-05 22:55:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715588402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:31,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:55:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823593398] [2025-02-05 22:55:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:31,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:55:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:31,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:55:31,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:31,503 INFO L87 Difference]: Start difference. First operand 3084 states and 4879 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:32,021 INFO L93 Difference]: Finished difference Result 7230 states and 11425 transitions. [2025-02-05 22:55:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:55:32,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2025-02-05 22:55:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:32,046 INFO L225 Difference]: With dead ends: 7230 [2025-02-05 22:55:32,046 INFO L226 Difference]: Without dead ends: 5686 [2025-02-05 22:55:32,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:32,050 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 318 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:32,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 919 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:55:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2025-02-05 22:55:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 3539. [2025-02-05 22:55:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 3042 states have (on average 1.5378040762656147) internal successors, (4678), 3058 states have internal predecessors, (4678), 464 states have call successors, (464), 32 states have call predecessors, (464), 32 states have return successors, (464), 448 states have call predecessors, (464), 464 states have call successors, (464) [2025-02-05 22:55:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 5606 transitions. [2025-02-05 22:55:32,245 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 5606 transitions. Word has length 163 [2025-02-05 22:55:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:32,245 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 5606 transitions. [2025-02-05 22:55:32,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 5606 transitions. [2025-02-05 22:55:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 22:55:32,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:32,248 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:32,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:55:32,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:32,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash 353524096, now seen corresponding path program 1 times [2025-02-05 22:55:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201906966] [2025-02-05 22:55:32,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:32,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:55:32,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:55:32,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:32,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201906966] [2025-02-05 22:55:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201906966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:55:32,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710473232] [2025-02-05 22:55:32,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:32,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:55:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:32,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:55:32,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:55:32,539 INFO L87 Difference]: Start difference. First operand 3539 states and 5606 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:32,801 INFO L93 Difference]: Finished difference Result 8649 states and 13695 transitions. [2025-02-05 22:55:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:55:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2025-02-05 22:55:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:32,824 INFO L225 Difference]: With dead ends: 8649 [2025-02-05 22:55:32,825 INFO L226 Difference]: Without dead ends: 5113 [2025-02-05 22:55:32,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:32,834 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 99 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:32,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 407 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:55:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2025-02-05 22:55:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 5076. [2025-02-05 22:55:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 4362 states have (on average 1.5375974323704722) internal successors, (6707), 4385 states have internal predecessors, (6707), 667 states have call successors, (667), 46 states have call predecessors, (667), 46 states have return successors, (667), 644 states have call predecessors, (667), 667 states have call successors, (667) [2025-02-05 22:55:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 8041 transitions. [2025-02-05 22:55:33,083 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 8041 transitions. Word has length 163 [2025-02-05 22:55:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:33,083 INFO L471 AbstractCegarLoop]: Abstraction has 5076 states and 8041 transitions. [2025-02-05 22:55:33,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 8041 transitions. [2025-02-05 22:55:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 22:55:33,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:33,087 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:33,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:55:33,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1896123710, now seen corresponding path program 1 times [2025-02-05 22:55:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657404223] [2025-02-05 22:55:33,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:33,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:55:33,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:55:33,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:33,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 75 proven. 51 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-02-05 22:55:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657404223] [2025-02-05 22:55:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657404223] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484792994] [2025-02-05 22:55:34,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:34,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:34,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:34,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:55:34,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:55:34,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:55:34,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:55:34,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:34,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:34,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 22:55:34,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:34,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484792994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:34,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:55:34,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-05 22:55:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332309444] [2025-02-05 22:55:34,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:34,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:55:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:34,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:55:34,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:55:34,351 INFO L87 Difference]: Start difference. First operand 5076 states and 8041 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:35,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-02-05 22:55:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:36,372 INFO L93 Difference]: Finished difference Result 12069 states and 18855 transitions. [2025-02-05 22:55:36,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:55:36,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2025-02-05 22:55:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:36,407 INFO L225 Difference]: With dead ends: 12069 [2025-02-05 22:55:36,407 INFO L226 Difference]: Without dead ends: 6996 [2025-02-05 22:55:36,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:55:36,418 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 74 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:36,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 494 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 22:55:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2025-02-05 22:55:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 6948. [2025-02-05 22:55:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6948 states, 6096 states have (on average 1.5113188976377954) internal successors, (9213), 6165 states have internal predecessors, (9213), 759 states have call successors, (759), 92 states have call predecessors, (759), 92 states have return successors, (759), 690 states have call predecessors, (759), 759 states have call successors, (759) [2025-02-05 22:55:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6948 states to 6948 states and 10731 transitions. [2025-02-05 22:55:36,778 INFO L78 Accepts]: Start accepts. Automaton has 6948 states and 10731 transitions. Word has length 163 [2025-02-05 22:55:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:36,778 INFO L471 AbstractCegarLoop]: Abstraction has 6948 states and 10731 transitions. [2025-02-05 22:55:36,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6948 states and 10731 transitions. [2025-02-05 22:55:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 22:55:36,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:36,782 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:36,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:55:36,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:36,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:36,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash -570892070, now seen corresponding path program 1 times [2025-02-05 22:55:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:36,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558222882] [2025-02-05 22:55:36,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:36,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:55:37,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:55:37,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:37,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:37,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:37,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558222882] [2025-02-05 22:55:37,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558222882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:37,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:37,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:55:37,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515025068] [2025-02-05 22:55:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:37,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:55:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:37,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:55:37,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:37,136 INFO L87 Difference]: Start difference. First operand 6948 states and 10731 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:37,786 INFO L93 Difference]: Finished difference Result 17174 states and 26629 transitions. [2025-02-05 22:55:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:55:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2025-02-05 22:55:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:37,825 INFO L225 Difference]: With dead ends: 17174 [2025-02-05 22:55:37,826 INFO L226 Difference]: Without dead ends: 12249 [2025-02-05 22:55:37,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:37,841 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 473 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:37,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 481 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:55:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12249 states. [2025-02-05 22:55:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12249 to 11401. [2025-02-05 22:55:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11401 states, 10068 states have (on average 1.5149980135081447) internal successors, (15253), 10176 states have internal predecessors, (15253), 1188 states have call successors, (1188), 144 states have call predecessors, (1188), 144 states have return successors, (1188), 1080 states have call predecessors, (1188), 1188 states have call successors, (1188) [2025-02-05 22:55:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 17629 transitions. [2025-02-05 22:55:38,477 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 17629 transitions. Word has length 164 [2025-02-05 22:55:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:38,477 INFO L471 AbstractCegarLoop]: Abstraction has 11401 states and 17629 transitions. [2025-02-05 22:55:38,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 17629 transitions. [2025-02-05 22:55:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 22:55:38,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:38,484 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:38,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:55:38,484 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:38,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:38,485 INFO L85 PathProgramCache]: Analyzing trace with hash -637898823, now seen corresponding path program 1 times [2025-02-05 22:55:38,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:38,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347478785] [2025-02-05 22:55:38,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:38,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:55:38,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:55:38,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:38,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:38,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347478785] [2025-02-05 22:55:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347478785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:38,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:55:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683687110] [2025-02-05 22:55:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:55:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:38,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:55:38,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:38,633 INFO L87 Difference]: Start difference. First operand 11401 states and 17629 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:39,220 INFO L93 Difference]: Finished difference Result 23199 states and 35962 transitions. [2025-02-05 22:55:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:55:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2025-02-05 22:55:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:39,285 INFO L225 Difference]: With dead ends: 23199 [2025-02-05 22:55:39,286 INFO L226 Difference]: Without dead ends: 14683 [2025-02-05 22:55:39,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:39,335 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 354 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:39,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 574 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:55:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14683 states. [2025-02-05 22:55:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14683 to 13742. [2025-02-05 22:55:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13742 states, 12187 states have (on average 1.5144826454418643) internal successors, (18457), 12313 states have internal predecessors, (18457), 1386 states have call successors, (1386), 168 states have call predecessors, (1386), 168 states have return successors, (1386), 1260 states have call predecessors, (1386), 1386 states have call successors, (1386) [2025-02-05 22:55:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13742 states to 13742 states and 21229 transitions. [2025-02-05 22:55:39,888 INFO L78 Accepts]: Start accepts. Automaton has 13742 states and 21229 transitions. Word has length 164 [2025-02-05 22:55:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:39,889 INFO L471 AbstractCegarLoop]: Abstraction has 13742 states and 21229 transitions. [2025-02-05 22:55:39,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 13742 states and 21229 transitions. [2025-02-05 22:55:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 22:55:39,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:39,893 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:39,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:55:39,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:39,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash -740062926, now seen corresponding path program 1 times [2025-02-05 22:55:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:39,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524877072] [2025-02-05 22:55:39,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:39,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:39,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:55:39,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:55:39,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:39,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524877072] [2025-02-05 22:55:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524877072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:40,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:40,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:55:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837600728] [2025-02-05 22:55:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:55:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:40,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:55:40,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:40,237 INFO L87 Difference]: Start difference. First operand 13742 states and 21229 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:40,864 INFO L93 Difference]: Finished difference Result 23426 states and 36102 transitions. [2025-02-05 22:55:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:55:40,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2025-02-05 22:55:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:40,909 INFO L225 Difference]: With dead ends: 23426 [2025-02-05 22:55:40,909 INFO L226 Difference]: Without dead ends: 15504 [2025-02-05 22:55:40,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:40,930 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 375 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:40,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 646 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:55:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15504 states. [2025-02-05 22:55:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15504 to 10254. [2025-02-05 22:55:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10254 states, 9106 states have (on average 1.514276301339776) internal successors, (13789), 9199 states have internal predecessors, (13789), 1023 states have call successors, (1023), 124 states have call predecessors, (1023), 124 states have return successors, (1023), 930 states have call predecessors, (1023), 1023 states have call successors, (1023) [2025-02-05 22:55:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10254 states to 10254 states and 15835 transitions. [2025-02-05 22:55:41,514 INFO L78 Accepts]: Start accepts. Automaton has 10254 states and 15835 transitions. Word has length 164 [2025-02-05 22:55:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:41,515 INFO L471 AbstractCegarLoop]: Abstraction has 10254 states and 15835 transitions. [2025-02-05 22:55:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 10254 states and 15835 transitions. [2025-02-05 22:55:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 22:55:41,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:41,519 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:41,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:55:41,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:41,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash 549650589, now seen corresponding path program 1 times [2025-02-05 22:55:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279341527] [2025-02-05 22:55:41,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:41,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:41,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:55:41,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:55:41,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:41,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:41,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279341527] [2025-02-05 22:55:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279341527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:41,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:41,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:55:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213581334] [2025-02-05 22:55:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:41,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:55:41,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:41,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:55:41,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:55:41,774 INFO L87 Difference]: Start difference. First operand 10254 states and 15835 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:42,361 INFO L93 Difference]: Finished difference Result 24089 states and 37153 transitions. [2025-02-05 22:55:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:55:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2025-02-05 22:55:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:42,406 INFO L225 Difference]: With dead ends: 24089 [2025-02-05 22:55:42,406 INFO L226 Difference]: Without dead ends: 13838 [2025-02-05 22:55:42,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:42,434 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 97 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:42,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 406 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:55:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13838 states. [2025-02-05 22:55:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13838 to 13705. [2025-02-05 22:55:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13705 states, 12150 states have (on average 1.5107818930041153) internal successors, (18356), 12276 states have internal predecessors, (18356), 1386 states have call successors, (1386), 168 states have call predecessors, (1386), 168 states have return successors, (1386), 1260 states have call predecessors, (1386), 1386 states have call successors, (1386) [2025-02-05 22:55:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13705 states to 13705 states and 21128 transitions. [2025-02-05 22:55:42,994 INFO L78 Accepts]: Start accepts. Automaton has 13705 states and 21128 transitions. Word has length 164 [2025-02-05 22:55:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:42,995 INFO L471 AbstractCegarLoop]: Abstraction has 13705 states and 21128 transitions. [2025-02-05 22:55:42,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 13705 states and 21128 transitions. [2025-02-05 22:55:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 22:55:42,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:42,998 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:42,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:55:42,999 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:42,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1358952560, now seen corresponding path program 1 times [2025-02-05 22:55:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191954885] [2025-02-05 22:55:43,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:43,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:55:43,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:55:43,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:43,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:55:43,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191954885] [2025-02-05 22:55:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191954885] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259028709] [2025-02-05 22:55:43,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:43,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:43,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:43,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:55:43,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:55:43,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:55:43,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:55:43,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:43,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:43,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 22:55:43,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 609 proven. 54 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-02-05 22:55:44,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:55:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259028709] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:55:44,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:55:44,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 18 [2025-02-05 22:55:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525251255] [2025-02-05 22:55:44,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:55:44,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 22:55:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:44,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 22:55:44,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:55:44,602 INFO L87 Difference]: Start difference. First operand 13705 states and 21128 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2025-02-05 22:55:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:48,529 INFO L93 Difference]: Finished difference Result 48227 states and 72174 transitions. [2025-02-05 22:55:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-05 22:55:48,530 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 164 [2025-02-05 22:55:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:48,640 INFO L225 Difference]: With dead ends: 48227 [2025-02-05 22:55:48,641 INFO L226 Difference]: Without dead ends: 34405 [2025-02-05 22:55:48,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1169, Invalid=3661, Unknown=0, NotChecked=0, Total=4830 [2025-02-05 22:55:48,672 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 2151 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:48,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 1118 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 22:55:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34405 states. [2025-02-05 22:55:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34405 to 12975. [2025-02-05 22:55:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12975 states, 11116 states have (on average 1.4453940266282836) internal successors, (16067), 11266 states have internal predecessors, (16067), 1546 states have call successors, (1546), 312 states have call predecessors, (1546), 312 states have return successors, (1546), 1396 states have call predecessors, (1546), 1546 states have call successors, (1546) [2025-02-05 22:55:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 19159 transitions. [2025-02-05 22:55:49,875 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 19159 transitions. Word has length 164 [2025-02-05 22:55:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:49,875 INFO L471 AbstractCegarLoop]: Abstraction has 12975 states and 19159 transitions. [2025-02-05 22:55:49,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2025-02-05 22:55:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 19159 transitions. [2025-02-05 22:55:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:55:49,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:49,879 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:49,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 22:55:50,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:50,080 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:50,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1337177035, now seen corresponding path program 1 times [2025-02-05 22:55:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:50,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993090207] [2025-02-05 22:55:50,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:50,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:55:50,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:55:50,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:50,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993090207] [2025-02-05 22:55:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993090207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:50,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:55:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174428362] [2025-02-05 22:55:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:55:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:50,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:55:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:55:50,220 INFO L87 Difference]: Start difference. First operand 12975 states and 19159 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:51,098 INFO L93 Difference]: Finished difference Result 30475 states and 44901 transitions. [2025-02-05 22:55:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:55:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2025-02-05 22:55:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:51,150 INFO L225 Difference]: With dead ends: 30475 [2025-02-05 22:55:51,150 INFO L226 Difference]: Without dead ends: 17282 [2025-02-05 22:55:51,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:55:51,172 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 251 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:51,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 438 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:55:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17282 states. [2025-02-05 22:55:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17282 to 11670. [2025-02-05 22:55:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11670 states, 9889 states have (on average 1.4325007584184448) internal successors, (14166), 10033 states have internal predecessors, (14166), 1480 states have call successors, (1480), 300 states have call predecessors, (1480), 300 states have return successors, (1480), 1336 states have call predecessors, (1480), 1480 states have call successors, (1480) [2025-02-05 22:55:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11670 states to 11670 states and 17126 transitions. [2025-02-05 22:55:51,935 INFO L78 Accepts]: Start accepts. Automaton has 11670 states and 17126 transitions. Word has length 165 [2025-02-05 22:55:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:51,936 INFO L471 AbstractCegarLoop]: Abstraction has 11670 states and 17126 transitions. [2025-02-05 22:55:51,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11670 states and 17126 transitions. [2025-02-05 22:55:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:55:51,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:51,938 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:51,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 22:55:51,938 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:51,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:51,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1368196842, now seen corresponding path program 1 times [2025-02-05 22:55:51,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:51,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505572594] [2025-02-05 22:55:51,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:51,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:51,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:55:51,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:55:51,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:51,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:52,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:52,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505572594] [2025-02-05 22:55:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505572594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:52,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:52,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:55:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243665734] [2025-02-05 22:55:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:52,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:55:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:52,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:55:52,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:52,106 INFO L87 Difference]: Start difference. First operand 11670 states and 17126 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:53,004 INFO L93 Difference]: Finished difference Result 26557 states and 38920 transitions. [2025-02-05 22:55:53,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:55:53,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2025-02-05 22:55:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:53,043 INFO L225 Difference]: With dead ends: 26557 [2025-02-05 22:55:53,043 INFO L226 Difference]: Without dead ends: 14908 [2025-02-05 22:55:53,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:53,060 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 156 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:53,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 410 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:55:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14908 states. [2025-02-05 22:55:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14908 to 13157. [2025-02-05 22:55:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13157 states, 11157 states have (on average 1.4340772609124317) internal successors, (16000), 11319 states have internal predecessors, (16000), 1663 states have call successors, (1663), 336 states have call predecessors, (1663), 336 states have return successors, (1663), 1501 states have call predecessors, (1663), 1663 states have call successors, (1663) [2025-02-05 22:55:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 19326 transitions. [2025-02-05 22:55:53,835 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 19326 transitions. Word has length 165 [2025-02-05 22:55:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:53,837 INFO L471 AbstractCegarLoop]: Abstraction has 13157 states and 19326 transitions. [2025-02-05 22:55:53,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 19326 transitions. [2025-02-05 22:55:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 22:55:53,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:53,839 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:53,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 22:55:53,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:53,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2091244618, now seen corresponding path program 1 times [2025-02-05 22:55:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885052469] [2025-02-05 22:55:53,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:53,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:55:53,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:55:53,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:53,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885052469] [2025-02-05 22:55:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885052469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:53,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:53,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:55:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832769157] [2025-02-05 22:55:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:53,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:55:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:53,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:55:53,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:53,996 INFO L87 Difference]: Start difference. First operand 13157 states and 19326 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:55,335 INFO L93 Difference]: Finished difference Result 25763 states and 37871 transitions. [2025-02-05 22:55:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:55:55,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2025-02-05 22:55:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:55,380 INFO L225 Difference]: With dead ends: 25763 [2025-02-05 22:55:55,381 INFO L226 Difference]: Without dead ends: 15089 [2025-02-05 22:55:55,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:55:55,401 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 155 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:55,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 409 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:55:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15089 states. [2025-02-05 22:55:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15089 to 13671. [2025-02-05 22:55:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13671 states, 11593 states have (on average 1.4351763995514535) internal successors, (16638), 11761 states have internal predecessors, (16638), 1729 states have call successors, (1729), 348 states have call predecessors, (1729), 348 states have return successors, (1729), 1561 states have call predecessors, (1729), 1729 states have call successors, (1729) [2025-02-05 22:55:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13671 states to 13671 states and 20096 transitions. [2025-02-05 22:55:56,371 INFO L78 Accepts]: Start accepts. Automaton has 13671 states and 20096 transitions. Word has length 166 [2025-02-05 22:55:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:56,371 INFO L471 AbstractCegarLoop]: Abstraction has 13671 states and 20096 transitions. [2025-02-05 22:55:56,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 13671 states and 20096 transitions. [2025-02-05 22:55:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 22:55:56,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:56,373 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:56,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 22:55:56,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash -183357855, now seen corresponding path program 1 times [2025-02-05 22:55:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976253507] [2025-02-05 22:55:56,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:56,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:55:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:55:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:55:56,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:56,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976253507] [2025-02-05 22:55:56,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976253507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:56,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:55:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493017318] [2025-02-05 22:55:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:56,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:55:56,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:56,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:55:56,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:55:56,481 INFO L87 Difference]: Start difference. First operand 13671 states and 20096 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:57,334 INFO L93 Difference]: Finished difference Result 23532 states and 34637 transitions. [2025-02-05 22:55:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:55:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2025-02-05 22:55:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:57,366 INFO L225 Difference]: With dead ends: 23532 [2025-02-05 22:55:57,367 INFO L226 Difference]: Without dead ends: 13685 [2025-02-05 22:55:57,381 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-02-05 22:55:57,383 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 199 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:57,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 607 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:55:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13685 states. [2025-02-05 22:55:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13685 to 13677. [2025-02-05 22:55:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13677 states, 11599 states have (on average 1.434951288904216) internal successors, (16644), 11767 states have internal predecessors, (16644), 1729 states have call successors, (1729), 348 states have call predecessors, (1729), 348 states have return successors, (1729), 1561 states have call predecessors, (1729), 1729 states have call successors, (1729) [2025-02-05 22:55:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 20102 transitions. [2025-02-05 22:55:58,065 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 20102 transitions. Word has length 166 [2025-02-05 22:55:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:58,066 INFO L471 AbstractCegarLoop]: Abstraction has 13677 states and 20102 transitions. [2025-02-05 22:55:58,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:55:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 20102 transitions. [2025-02-05 22:55:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 22:55:58,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:58,067 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:58,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 22:55:58,068 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:58,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1668195873, now seen corresponding path program 1 times [2025-02-05 22:55:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85893449] [2025-02-05 22:55:58,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:58,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:55:58,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:55:58,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:55:58,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85893449] [2025-02-05 22:55:58,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85893449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155322143] [2025-02-05 22:55:58,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:58,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:58,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:58,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:55:58,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 22:55:58,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:55:58,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:55:58,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:58,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:58,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 22:55:58,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 396 proven. 15 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-02-05 22:55:58,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:55:58,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155322143] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:55:58,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:55:58,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-05 22:55:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60612005] [2025-02-05 22:55:58,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:55:58,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:55:58,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:58,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:55:58,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:55:58,661 INFO L87 Difference]: Start difference. First operand 13677 states and 20102 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 22:56:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:00,283 INFO L93 Difference]: Finished difference Result 30936 states and 45119 transitions. [2025-02-05 22:56:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 22:56:00,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 166 [2025-02-05 22:56:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:00,331 INFO L225 Difference]: With dead ends: 30936 [2025-02-05 22:56:00,331 INFO L226 Difference]: Without dead ends: 16838 [2025-02-05 22:56:00,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:56:00,370 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 475 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:00,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 573 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:56:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16838 states. [2025-02-05 22:56:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16838 to 12123. [2025-02-05 22:56:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12123 states, 10198 states have (on average 1.393998823298686) internal successors, (14216), 10351 states have internal predecessors, (14216), 1564 states have call successors, (1564), 360 states have call predecessors, (1564), 360 states have return successors, (1564), 1411 states have call predecessors, (1564), 1564 states have call successors, (1564) [2025-02-05 22:56:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12123 states to 12123 states and 17344 transitions. [2025-02-05 22:56:01,397 INFO L78 Accepts]: Start accepts. Automaton has 12123 states and 17344 transitions. Word has length 166 [2025-02-05 22:56:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:01,398 INFO L471 AbstractCegarLoop]: Abstraction has 12123 states and 17344 transitions. [2025-02-05 22:56:01,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 22:56:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 12123 states and 17344 transitions. [2025-02-05 22:56:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 22:56:01,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:01,400 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:56:01,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 22:56:01,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-05 22:56:01,604 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:01,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash 693086230, now seen corresponding path program 1 times [2025-02-05 22:56:01,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:01,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142022271] [2025-02-05 22:56:01,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:01,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:01,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 22:56:01,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 22:56:01,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:01,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:56:01,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973570897] [2025-02-05 22:56:01,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:01,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:56:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:56:01,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:56:01,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 22:56:01,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 22:56:01,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 22:56:01,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:01,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:56:01,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:56:01,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 22:56:01,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 22:56:01,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:01,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:56:01,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:56:01,869 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:56:01,870 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:56:01,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 22:56:02,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 22:56:02,075 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:56:02,174 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:56:02,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:56:02 BoogieIcfgContainer [2025-02-05 22:56:02,179 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:56:02,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:56:02,180 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:56:02,180 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:56:02,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:55:26" (3/4) ... [2025-02-05 22:56:02,182 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:56:02,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:56:02,184 INFO L158 Benchmark]: Toolchain (without parser) took 36523.47ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 106.9MB in the beginning and 733.3MB in the end (delta: -626.4MB). Peak memory consumption was 353.9MB. Max. memory is 16.1GB. [2025-02-05 22:56:02,184 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:56:02,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.11ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 91.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:56:02,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.38ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 86.4MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:56:02,185 INFO L158 Benchmark]: Boogie Preprocessor took 48.22ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 81.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:56:02,185 INFO L158 Benchmark]: IcfgBuilder took 579.32ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 47.9MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 22:56:02,185 INFO L158 Benchmark]: TraceAbstraction took 35543.98ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 47.9MB in the beginning and 733.5MB in the end (delta: -685.5MB). Peak memory consumption was 295.2MB. Max. memory is 16.1GB. [2025-02-05 22:56:02,186 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 1.1GB. Free memory was 733.5MB in the beginning and 733.3MB in the end (delta: 180.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:56:02,186 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.11ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 91.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.38ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 86.4MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.22ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 81.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 579.32ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 47.9MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35543.98ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 47.9MB in the beginning and 733.5MB in the end (delta: -685.5MB). Peak memory consumption was 295.2MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 1.1GB. Free memory was 733.5MB in the beginning and 733.3MB in the end (delta: 180.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 bitwiseOr at line 116, overapproximation of bitwiseAnd at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 175. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] signed short int var_1_28 = 256; [L39] signed long int var_1_30 = -4; [L40] double var_1_32 = 0.0; [L41] unsigned short int var_1_34 = 34858; [L42] unsigned short int var_1_35 = 41225; [L43] double var_1_37 = 63.63; [L44] signed char var_1_39 = 10; [L45] signed char var_1_40 = -25; [L46] signed char var_1_41 = 4; [L47] unsigned char var_1_42 = 50; [L48] unsigned long int last_1_var_1_10 = 256; [L49] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] CALL updateLastVariables() [L171] last_1_var_1_10 = var_1_10 [L172] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L182] RET updateLastVariables() [L183] CALL updateVariables() [L134] var_1_3 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L137] var_1_5 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L138] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L139] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L139] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L140] var_1_13 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L141] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L142] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L142] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L143] var_1_14 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L144] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L145] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L146] var_1_15 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L147] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L148] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L149] var_1_16 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L151] var_1_21 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L152] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L153] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L154] var_1_22 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L155] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L156] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L156] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L157] var_1_34 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L159] CALL assume_abort_if_not(var_1_34 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L159] RET assume_abort_if_not(var_1_34 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L160] var_1_35 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_35 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L161] RET assume_abort_if_not(var_1_35 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L162] CALL assume_abort_if_not(var_1_35 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L162] RET assume_abort_if_not(var_1_35 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L163] var_1_40 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L164] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L165] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L165] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=0, var_1_6=256] [L166] var_1_41 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_41 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L167] RET assume_abort_if_not(var_1_41 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L168] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L168] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L183] RET updateVariables() [L184] CALL step() [L53] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L58] COND FALSE !(var_1_20 > var_1_21) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L71] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L72] COND FALSE !(stepLocal_2 > last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L75] var_1_28 = var_1_5 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=0, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L76] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=0, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L77] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=0, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L81] COND FALSE !(var_1_14 >= ((((var_1_20) > (var_1_6)) ? (var_1_20) : (var_1_6)))) [L84] var_1_24 = (((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L86] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L87] COND FALSE !(stepLocal_1 || var_1_3) [L92] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L94] EXPR var_1_14 ^ var_1_21 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=-4, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L94] COND TRUE ((var_1_14 ^ var_1_21) % var_1_21) > -10 [L95] var_1_30 = ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L97] EXPR var_1_35 & var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L97] EXPR (var_1_35 & var_1_20) >> var_1_14 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L97] COND TRUE var_1_14 >= ((var_1_35 & var_1_20) >> var_1_14) [L98] var_1_37 = ((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L100] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L111] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L116] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L116] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L117] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L118] COND TRUE var_1_12 == var_1_12 [L119] var_1_10 = 0u VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L122] EXPR ((((var_1_5) > (-16)) ? (var_1_5) : (-16))) & 16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L122] COND FALSE !((~ var_1_23) <= (((((var_1_5) > (-16)) ? (var_1_5) : (-16))) & 16)) [L125] COND TRUE var_1_10 <= (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) [L126] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=2, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L131] var_1_39 = (var_1_40 + ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=2, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=2, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L175-L176] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=2, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=0, var_1_23=64, var_1_24=256, var_1_28=0, var_1_30=32, var_1_32=2, var_1_34=32768, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=0, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.4s, OverallIterations: 22, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 6512 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6481 mSDsluCounter, 10440 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6069 mSDsCounter, 1074 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4783 IncrementalHoareTripleChecker+Invalid, 5858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1074 mSolverCounterUnsat, 4371 mSDtfsCounter, 4783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1184 GetRequests, 1041 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13742occurred in iteration=13, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 45450 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 4416 NumberOfCodeBlocks, 4416 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4383 ConstructedInterpolants, 19 QuantifiedInterpolants, 11128 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1545 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 27 InterpolantComputations, 19 PerfectInterpolantSequences, 27082/27324 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-02-05 22:56:02,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:56:04,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:56:04,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:56:04,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:56:04,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:56:04,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:56:04,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:56:04,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:56:04,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:56:04,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:56:04,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:56:04,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:56:04,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:56:04,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:56:04,482 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:56:04,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:56:04,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:56:04,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:56:04,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:56:04,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:56:04,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:56:04,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:56:04,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:56:04,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:56:04,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:56:04,485 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-jdk21/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 -> a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5 [2025-02-05 22:56:04,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:56:04,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:56:04,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:56:04,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:56:04,738 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:56:04,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2025-02-05 22:56:05,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0a8c9944/7ebb76ea19fd4606926c4af8ea94074e/FLAG64c767d05 [2025-02-05 22:56:06,160 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:56:06,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2025-02-05 22:56:06,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0a8c9944/7ebb76ea19fd4606926c4af8ea94074e/FLAG64c767d05 [2025-02-05 22:56:06,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0a8c9944/7ebb76ea19fd4606926c4af8ea94074e [2025-02-05 22:56:06,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:56:06,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:56:06,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:56:06,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:56:06,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:56:06,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06, skipping insertion in model container [2025-02-05 22:56:06,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:56:06,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931] [2025-02-05 22:56:06,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:56:06,368 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:56:06,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931] [2025-02-05 22:56:06,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:56:06,421 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:56:06,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06 WrapperNode [2025-02-05 22:56:06,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:56:06,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:56:06,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:56:06,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:56:06,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,451 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-02-05 22:56:06,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:56:06,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:56:06,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:56:06,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:56:06,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,469 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-02-05 22:56:06,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:56:06,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:56:06,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:56:06,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:56:06,484 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (1/1) ... [2025-02-05 22:56:06,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:56:06,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:56:06,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:56:06,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:56:06,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:56:06,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:56:06,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:56:06,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:56:06,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:56:06,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:56:06,593 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:56:06,594 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:56:21,823 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 22:56:21,824 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:56:21,830 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:56:21,831 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:56:21,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:56:21 BoogieIcfgContainer [2025-02-05 22:56:21,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:56:21,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:56:21,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:56:21,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:56:21,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:56:06" (1/3) ... [2025-02-05 22:56:21,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281f758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:56:21, skipping insertion in model container [2025-02-05 22:56:21,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:06" (2/3) ... [2025-02-05 22:56:21,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281f758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:56:21, skipping insertion in model container [2025-02-05 22:56:21,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:56:21" (3/3) ... [2025-02-05 22:56:21,838 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2025-02-05 22:56:21,847 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:56:21,848 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:56:21,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:56:21,889 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;@514b06aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:56:21,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:56:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 56 states have (on average 1.5) internal successors, (84), 57 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:56:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 22:56:21,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:21,900 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:56:21,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:21,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash -584968133, now seen corresponding path program 1 times [2025-02-05 22:56:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:56:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878359479] [2025-02-05 22:56:21,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:21,911 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-02-05 22:56:21,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:56:21,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 22:56:21,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:56:21,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 22:56:22,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 22:56:22,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:22,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:22,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:56:22,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:56:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-02-05 22:56:22,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:56:22,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:56:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878359479] [2025-02-05 22:56:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878359479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:56:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810539591] [2025-02-05 22:56:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:22,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:56:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:56:22,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:56:22,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:56:22,927 INFO L87 Difference]: Start difference. First operand has 82 states, 56 states have (on average 1.5) internal successors, (84), 57 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:56:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:22,944 INFO L93 Difference]: Finished difference Result 158 states and 278 transitions. [2025-02-05 22:56:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:56:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2025-02-05 22:56:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:22,950 INFO L225 Difference]: With dead ends: 158 [2025-02-05 22:56:22,950 INFO L226 Difference]: Without dead ends: 79 [2025-02-05 22:56:22,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-02-05 22:56:22,954 INFO L435 NwaCegarLoop]: 124 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, 124 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-02-05 22:56:22,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:56:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-05 22:56:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-05 22:56:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:56:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2025-02-05 22:56:22,987 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 153 [2025-02-05 22:56:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:22,988 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2025-02-05 22:56:22,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:56:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2025-02-05 22:56:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 22:56:22,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:22,990 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:56:23,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-05 22:56:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 22:56:23,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1727616412, now seen corresponding path program 1 times [2025-02-05 22:56:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:56:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007434898] [2025-02-05 22:56:23,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:23,196 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-02-05 22:56:23,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:56:23,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 22:56:23,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:56:23,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 22:56:24,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 22:56:24,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:24,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:24,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 22:56:24,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:56:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-02-05 22:56:30,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:56:31,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:56:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007434898] [2025-02-05 22:56:31,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007434898] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:56:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1809657846] [2025-02-05 22:56:31,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:31,744 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:56:31,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:56:31,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:56:31,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-05 22:56:31,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 22:56:33,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 22:56:33,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:33,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:33,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:56:33,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:56:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:56:41,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:56:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1809657846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:41,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:56:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 22:56:41,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878769161] [2025-02-05 22:56:41,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:41,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:56:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:56:41,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:56:41,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:56:41,241 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)