./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:37:10,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:37:10,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:37:10,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:37:10,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:37:10,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:37:10,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:37:10,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:37:10,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:37:10,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:37:10,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:37:10,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:37:10,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:37:10,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:37:10,627 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:37:10,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:37:10,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:37:10,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:37:10,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:37:10,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:37:10,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:37:10,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:37:10,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:37:10,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:37:10,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:37:10,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:37:10,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:37:10,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:37:10,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:37:10,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 [2025-03-03 22:37:10,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:37:10,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:37:10,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:37:10,847 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:37:10,848 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:37:10,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-03 22:37:11,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e293eb397/d1bddca011524434aa0e809c1591e131/FLAGf126ab1ab [2025-03-03 22:37:12,158 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:37:12,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-03 22:37:12,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e293eb397/d1bddca011524434aa0e809c1591e131/FLAGf126ab1ab [2025-03-03 22:37:12,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e293eb397/d1bddca011524434aa0e809c1591e131 [2025-03-03 22:37:12,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:37:12,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:37:12,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:37:12,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:37:12,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:37:12,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66770e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12, skipping insertion in model container [2025-03-03 22:37:12,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:37:12,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i[916,929] [2025-03-03 22:37:12,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:37:12,669 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:37:12,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i[916,929] [2025-03-03 22:37:12,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:37:12,717 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:37:12,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12 WrapperNode [2025-03-03 22:37:12,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:37:12,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:37:12,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:37:12,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:37:12,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,746 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-03-03 22:37:12,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:37:12,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:37:12,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:37:12,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:37:12,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,769 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:37:12,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:37:12,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:37:12,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:37:12,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:37:12,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (1/1) ... [2025-03-03 22:37:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:37:12,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:37:12,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:37:12,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:37:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:37:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:37:12,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:37:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:37:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:37:12,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:37:12,883 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:37:12,884 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:37:13,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~bitwise16#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2025-03-03 22:37:13,131 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 22:37:13,131 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:37:13,143 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:37:13,144 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:37:13,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:37:13 BoogieIcfgContainer [2025-03-03 22:37:13,145 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:37:13,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:37:13,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:37:13,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:37:13,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:37:12" (1/3) ... [2025-03-03 22:37:13,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ded1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:37:13, skipping insertion in model container [2025-03-03 22:37:13,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:12" (2/3) ... [2025-03-03 22:37:13,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ded1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:37:13, skipping insertion in model container [2025-03-03 22:37:13,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:37:13" (3/3) ... [2025-03-03 22:37:13,152 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-03 22:37:13,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:37:13,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-56.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:37:13,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:37:13,222 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;@5d8d5e6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:37:13,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:37:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:37:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 22:37:13,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:13,237 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:13,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:13,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash 460502168, now seen corresponding path program 1 times [2025-03-03 22:37:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:13,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460946149] [2025-03-03 22:37:13,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:13,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 22:37:13,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 22:37:13,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:13,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:37:13,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:13,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460946149] [2025-03-03 22:37:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460946149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:37:13,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552460279] [2025-03-03 22:37:13,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:13,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:37:13,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:37:13,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:37:13,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:37:13,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 22:37:13,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 22:37:13,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:13,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:13,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:37:13,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:37:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:37:13,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:37:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552460279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:13,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:37:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:37:13,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030278603] [2025-03-03 22:37:13,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:13,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:37:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:13,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:37:13,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:37:13,648 INFO L87 Difference]: Start difference. First operand has 71 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:37:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:13,677 INFO L93 Difference]: Finished difference Result 136 states and 227 transitions. [2025-03-03 22:37:13,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:37:13,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-03 22:37:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:13,684 INFO L225 Difference]: With dead ends: 136 [2025-03-03 22:37:13,685 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 22:37:13,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:37:13,694 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:13,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:37:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 22:37:13,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 22:37:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:37:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2025-03-03 22:37:13,729 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 129 [2025-03-03 22:37:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:13,729 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2025-03-03 22:37:13,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:37:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2025-03-03 22:37:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 22:37:13,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:13,732 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:13,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:37:13,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:37:13,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:13,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash -185309032, now seen corresponding path program 1 times [2025-03-03 22:37:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954210128] [2025-03-03 22:37:13,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:13,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:13,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 22:37:14,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 22:37:14,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:14,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:23,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:23,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954210128] [2025-03-03 22:37:23,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954210128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:23,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:23,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:37:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044619960] [2025-03-03 22:37:23,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:23,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:37:23,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:23,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:37:23,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:37:23,105 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:23,453 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2025-03-03 22:37:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:37:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-03-03 22:37:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:23,457 INFO L225 Difference]: With dead ends: 186 [2025-03-03 22:37:23,457 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 22:37:23,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:37:23,458 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 61 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:23,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 364 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:37:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 22:37:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2025-03-03 22:37:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:37:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2025-03-03 22:37:23,475 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 129 [2025-03-03 22:37:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:23,477 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2025-03-03 22:37:23,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2025-03-03 22:37:23,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 22:37:23,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:23,478 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:23,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:37:23,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:23,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:23,479 INFO L85 PathProgramCache]: Analyzing trace with hash -478712039, now seen corresponding path program 1 times [2025-03-03 22:37:23,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:23,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904841259] [2025-03-03 22:37:23,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:23,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 22:37:23,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 22:37:23,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:23,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:23,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:23,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904841259] [2025-03-03 22:37:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904841259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:23,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:37:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445222935] [2025-03-03 22:37:23,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:23,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:37:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:37:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:37:23,553 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:23,588 INFO L93 Difference]: Finished difference Result 162 states and 247 transitions. [2025-03-03 22:37:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:37:23,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-03-03 22:37:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:23,589 INFO L225 Difference]: With dead ends: 162 [2025-03-03 22:37:23,589 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 22:37:23,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:37:23,590 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:23,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:37:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 22:37:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 22:37:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:37:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-03-03 22:37:23,602 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 129 [2025-03-03 22:37:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:23,604 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-03-03 22:37:23,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-03-03 22:37:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 22:37:23,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:23,606 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:23,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:37:23,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:23,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1912978532, now seen corresponding path program 1 times [2025-03-03 22:37:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:23,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964193929] [2025-03-03 22:37:23,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 22:37:23,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 22:37:23,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:23,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964193929] [2025-03-03 22:37:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964193929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:23,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:23,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:37:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829574387] [2025-03-03 22:37:23,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:37:23,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:23,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:37:23,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:37:23,670 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:23,713 INFO L93 Difference]: Finished difference Result 191 states and 288 transitions. [2025-03-03 22:37:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:37:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-03 22:37:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:23,715 INFO L225 Difference]: With dead ends: 191 [2025-03-03 22:37:23,716 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 22:37:23,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:37:23,717 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 33 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:23,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 169 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:37:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 22:37:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2025-03-03 22:37:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:37:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 147 transitions. [2025-03-03 22:37:23,723 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 147 transitions. Word has length 130 [2025-03-03 22:37:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:23,724 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 147 transitions. [2025-03-03 22:37:23,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 147 transitions. [2025-03-03 22:37:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 22:37:23,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:23,725 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:23,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:37:23,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:23,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash -214602258, now seen corresponding path program 1 times [2025-03-03 22:37:23,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:23,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481599423] [2025-03-03 22:37:23,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:23,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 22:37:23,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 22:37:23,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:23,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481599423] [2025-03-03 22:37:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481599423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:23,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:23,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:37:23,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682436450] [2025-03-03 22:37:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:23,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:37:23,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:23,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:37:23,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:37:23,790 INFO L87 Difference]: Start difference. First operand 97 states and 147 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:23,822 INFO L93 Difference]: Finished difference Result 205 states and 308 transitions. [2025-03-03 22:37:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:37:23,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-03 22:37:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:23,824 INFO L225 Difference]: With dead ends: 205 [2025-03-03 22:37:23,824 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 22:37:23,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:37:23,825 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:23,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 205 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:37:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 22:37:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2025-03-03 22:37:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:37:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2025-03-03 22:37:23,830 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 130 [2025-03-03 22:37:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:23,830 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2025-03-03 22:37:23,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2025-03-03 22:37:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 22:37:23,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:23,831 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:23,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:37:23,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash -809499018, now seen corresponding path program 1 times [2025-03-03 22:37:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905585166] [2025-03-03 22:37:23,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:23,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 22:37:23,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 22:37:23,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:23,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:32,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:32,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905585166] [2025-03-03 22:37:32,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905585166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:32,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:32,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:37:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860978361] [2025-03-03 22:37:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:32,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:37:32,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:32,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:37:32,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:37:32,138 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:32,346 INFO L93 Difference]: Finished difference Result 239 states and 348 transitions. [2025-03-03 22:37:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:37:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 22:37:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:32,347 INFO L225 Difference]: With dead ends: 239 [2025-03-03 22:37:32,348 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 22:37:32,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:37:32,349 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 99 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:32,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 299 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:37:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 22:37:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 94. [2025-03-03 22:37:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 72 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:37:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2025-03-03 22:37:32,359 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 131 [2025-03-03 22:37:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:32,359 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2025-03-03 22:37:32,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:32,359 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2025-03-03 22:37:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 22:37:32,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:32,360 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:32,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:37:32,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:32,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1623393201, now seen corresponding path program 1 times [2025-03-03 22:37:32,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:32,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598233515] [2025-03-03 22:37:32,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:32,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:32,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 22:37:32,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 22:37:32,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:32,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:32,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:32,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598233515] [2025-03-03 22:37:32,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598233515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:32,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:32,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:37:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461593303] [2025-03-03 22:37:32,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:32,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:37:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:32,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:37:32,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:37:32,629 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:32,776 INFO L93 Difference]: Finished difference Result 164 states and 238 transitions. [2025-03-03 22:37:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:37:32,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 22:37:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:32,777 INFO L225 Difference]: With dead ends: 164 [2025-03-03 22:37:32,777 INFO L226 Difference]: Without dead ends: 162 [2025-03-03 22:37:32,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:37:32,778 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 111 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:32,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 498 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:37:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-03 22:37:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2025-03-03 22:37:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 120 states have (on average 1.35) internal successors, (162), 121 states have internal predecessors, (162), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:37:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2025-03-03 22:37:32,792 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 131 [2025-03-03 22:37:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:32,792 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2025-03-03 22:37:32,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2025-03-03 22:37:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 22:37:32,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:32,794 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:32,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:37:32,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1315057643, now seen corresponding path program 1 times [2025-03-03 22:37:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:32,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59213969] [2025-03-03 22:37:32,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:32,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 22:37:32,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 22:37:32,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:32,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59213969] [2025-03-03 22:37:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59213969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:37:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431783073] [2025-03-03 22:37:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:40,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:37:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:40,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:37:40,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:37:40,242 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:40,831 INFO L93 Difference]: Finished difference Result 524 states and 767 transitions. [2025-03-03 22:37:40,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:37:40,834 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 22:37:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:40,839 INFO L225 Difference]: With dead ends: 524 [2025-03-03 22:37:40,839 INFO L226 Difference]: Without dead ends: 368 [2025-03-03 22:37:40,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:37:40,840 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 232 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:40,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 376 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:37:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-03 22:37:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 296. [2025-03-03 22:37:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.3378995433789955) internal successors, (293), 221 states have internal predecessors, (293), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:37:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 437 transitions. [2025-03-03 22:37:40,876 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 437 transitions. Word has length 131 [2025-03-03 22:37:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:40,877 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 437 transitions. [2025-03-03 22:37:40,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 437 transitions. [2025-03-03 22:37:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 22:37:40,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:40,878 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:40,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:37:40,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:40,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1510447151, now seen corresponding path program 1 times [2025-03-03 22:37:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:40,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170015985] [2025-03-03 22:37:40,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:40,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:40,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 22:37:40,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 22:37:40,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:40,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170015985] [2025-03-03 22:37:40,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170015985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:40,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:40,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:37:40,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853022318] [2025-03-03 22:37:40,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:40,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:37:40,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:40,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:37:40,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:37:40,915 INFO L87 Difference]: Start difference. First operand 296 states and 437 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:40,946 INFO L93 Difference]: Finished difference Result 589 states and 871 transitions. [2025-03-03 22:37:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:37:40,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 22:37:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:40,950 INFO L225 Difference]: With dead ends: 589 [2025-03-03 22:37:40,951 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 22:37:40,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:37:40,953 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:40,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:37:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 22:37:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-03 22:37:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.3287671232876712) internal successors, (291), 221 states have internal predecessors, (291), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:37:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 435 transitions. [2025-03-03 22:37:40,973 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 435 transitions. Word has length 131 [2025-03-03 22:37:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:40,974 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 435 transitions. [2025-03-03 22:37:40,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 435 transitions. [2025-03-03 22:37:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 22:37:40,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:40,976 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:40,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:37:40,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:40,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1004888526, now seen corresponding path program 1 times [2025-03-03 22:37:40,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:40,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080064718] [2025-03-03 22:37:40,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:40,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:40,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 22:37:40,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 22:37:40,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:40,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:37:57,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080064718] [2025-03-03 22:37:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080064718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:57,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:57,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:37:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593768602] [2025-03-03 22:37:57,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:57,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:37:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:57,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:37:57,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:37:57,341 INFO L87 Difference]: Start difference. First operand 296 states and 435 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:58,249 INFO L93 Difference]: Finished difference Result 561 states and 804 transitions. [2025-03-03 22:37:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:37:58,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 22:37:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:58,252 INFO L225 Difference]: With dead ends: 561 [2025-03-03 22:37:58,253 INFO L226 Difference]: Without dead ends: 405 [2025-03-03 22:37:58,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:37:58,254 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 67 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:58,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 446 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:37:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-03 22:37:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 315. [2025-03-03 22:37:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 238 states have (on average 1.3445378151260505) internal successors, (320), 240 states have internal predecessors, (320), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:37:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 464 transitions. [2025-03-03 22:37:58,282 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 464 transitions. Word has length 131 [2025-03-03 22:37:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:58,282 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 464 transitions. [2025-03-03 22:37:58,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:37:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 464 transitions. [2025-03-03 22:37:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 22:37:58,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:58,288 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:58,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:37:58,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:58,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash 711485519, now seen corresponding path program 1 times [2025-03-03 22:37:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:58,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781067584] [2025-03-03 22:37:58,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:58,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:58,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 22:37:58,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 22:37:58,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:58,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781067584] [2025-03-03 22:38:02,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781067584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:02,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:02,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:38:02,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891306242] [2025-03-03 22:38:02,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:02,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:38:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:02,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:38:02,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:38:02,993 INFO L87 Difference]: Start difference. First operand 315 states and 464 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:03,314 INFO L93 Difference]: Finished difference Result 773 states and 1099 transitions. [2025-03-03 22:38:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:38:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 22:38:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:03,317 INFO L225 Difference]: With dead ends: 773 [2025-03-03 22:38:03,317 INFO L226 Difference]: Without dead ends: 461 [2025-03-03 22:38:03,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:38:03,318 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 76 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:03,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 371 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:38:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-03 22:38:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 321. [2025-03-03 22:38:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 244 states have (on average 1.3360655737704918) internal successors, (326), 246 states have internal predecessors, (326), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:38:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 470 transitions. [2025-03-03 22:38:03,342 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 470 transitions. Word has length 131 [2025-03-03 22:38:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 470 transitions. [2025-03-03 22:38:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 470 transitions. [2025-03-03 22:38:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 22:38:03,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:03,344 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:03,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 22:38:03,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:03,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:03,345 INFO L85 PathProgramCache]: Analyzing trace with hash 291692561, now seen corresponding path program 1 times [2025-03-03 22:38:03,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:03,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758406635] [2025-03-03 22:38:03,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:03,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 22:38:03,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 22:38:03,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:03,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758406635] [2025-03-03 22:38:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758406635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:38:03,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060906237] [2025-03-03 22:38:03,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:38:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:03,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:38:03,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:03,393 INFO L87 Difference]: Start difference. First operand 321 states and 470 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:03,424 INFO L93 Difference]: Finished difference Result 795 states and 1154 transitions. [2025-03-03 22:38:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:38:03,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-03-03 22:38:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:03,427 INFO L225 Difference]: With dead ends: 795 [2025-03-03 22:38:03,427 INFO L226 Difference]: Without dead ends: 477 [2025-03-03 22:38:03,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:03,428 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 47 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:03,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 182 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:38:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-03 22:38:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 471. [2025-03-03 22:38:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 350 states have (on average 1.302857142857143) internal successors, (456), 356 states have internal predecessors, (456), 112 states have call successors, (112), 8 states have call predecessors, (112), 8 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 22:38:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 680 transitions. [2025-03-03 22:38:03,453 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 680 transitions. Word has length 133 [2025-03-03 22:38:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:03,453 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 680 transitions. [2025-03-03 22:38:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 680 transitions. [2025-03-03 22:38:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 22:38:03,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:03,455 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:03,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 22:38:03,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:03,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2084928527, now seen corresponding path program 1 times [2025-03-03 22:38:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516800985] [2025-03-03 22:38:03,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:03,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 22:38:03,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 22:38:03,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:03,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:03,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:03,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516800985] [2025-03-03 22:38:03,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516800985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:03,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:03,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:38:03,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806743171] [2025-03-03 22:38:03,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:03,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:38:03,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:03,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:38:03,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:03,503 INFO L87 Difference]: Start difference. First operand 471 states and 680 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:03,537 INFO L93 Difference]: Finished difference Result 909 states and 1302 transitions. [2025-03-03 22:38:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:38:03,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-03-03 22:38:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:03,540 INFO L225 Difference]: With dead ends: 909 [2025-03-03 22:38:03,541 INFO L226 Difference]: Without dead ends: 441 [2025-03-03 22:38:03,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:03,542 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 54 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:03,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 225 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:38:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-03 22:38:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 389. [2025-03-03 22:38:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 308 states have (on average 1.3181818181818181) internal successors, (406), 310 states have internal predecessors, (406), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:38:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 550 transitions. [2025-03-03 22:38:03,563 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 550 transitions. Word has length 133 [2025-03-03 22:38:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:03,563 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 550 transitions. [2025-03-03 22:38:03,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 550 transitions. [2025-03-03 22:38:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 22:38:03,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:03,565 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:03,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 22:38:03,565 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:03,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:03,566 INFO L85 PathProgramCache]: Analyzing trace with hash 454375281, now seen corresponding path program 1 times [2025-03-03 22:38:03,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:03,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961223090] [2025-03-03 22:38:03,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:03,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 22:38:03,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 22:38:03,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:03,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961223090] [2025-03-03 22:38:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961223090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:09,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:09,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:38:09,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994708995] [2025-03-03 22:38:09,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:09,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:38:09,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:09,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:38:09,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:38:09,511 INFO L87 Difference]: Start difference. First operand 389 states and 550 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:10,891 INFO L93 Difference]: Finished difference Result 817 states and 1145 transitions. [2025-03-03 22:38:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:38:10,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-03-03 22:38:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:10,894 INFO L225 Difference]: With dead ends: 817 [2025-03-03 22:38:10,894 INFO L226 Difference]: Without dead ends: 431 [2025-03-03 22:38:10,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:38:10,895 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 152 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:10,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 520 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:38:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-03 22:38:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 374. [2025-03-03 22:38:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 293 states have (on average 1.3242320819112627) internal successors, (388), 295 states have internal predecessors, (388), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:38:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 532 transitions. [2025-03-03 22:38:10,911 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 532 transitions. Word has length 133 [2025-03-03 22:38:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:10,912 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 532 transitions. [2025-03-03 22:38:10,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 532 transitions. [2025-03-03 22:38:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 22:38:10,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:10,913 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:10,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 22:38:10,913 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:10,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1417367633, now seen corresponding path program 1 times [2025-03-03 22:38:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684554461] [2025-03-03 22:38:10,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:10,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 22:38:10,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 22:38:10,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:10,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:11,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684554461] [2025-03-03 22:38:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684554461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:11,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:11,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:38:11,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796872267] [2025-03-03 22:38:11,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:11,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:38:11,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:11,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:38:11,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:38:11,147 INFO L87 Difference]: Start difference. First operand 374 states and 532 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:11,369 INFO L93 Difference]: Finished difference Result 486 states and 686 transitions. [2025-03-03 22:38:11,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:38:11,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-03-03 22:38:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:11,373 INFO L225 Difference]: With dead ends: 486 [2025-03-03 22:38:11,373 INFO L226 Difference]: Without dead ends: 484 [2025-03-03 22:38:11,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:38:11,374 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:11,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 866 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:38:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-03 22:38:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 480. [2025-03-03 22:38:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 381 states have (on average 1.3228346456692914) internal successors, (504), 385 states have internal predecessors, (504), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:38:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 680 transitions. [2025-03-03 22:38:11,408 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 680 transitions. Word has length 135 [2025-03-03 22:38:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:11,409 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 680 transitions. [2025-03-03 22:38:11,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 680 transitions. [2025-03-03 22:38:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 22:38:11,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:11,410 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:11,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 22:38:11,410 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1699004206, now seen corresponding path program 1 times [2025-03-03 22:38:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:11,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196034679] [2025-03-03 22:38:11,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:11,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:11,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 22:38:11,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 22:38:11,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:11,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196034679] [2025-03-03 22:38:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196034679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:38:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415421124] [2025-03-03 22:38:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:11,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:38:11,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:11,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:38:11,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:38:11,685 INFO L87 Difference]: Start difference. First operand 480 states and 680 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:12,030 INFO L93 Difference]: Finished difference Result 702 states and 960 transitions. [2025-03-03 22:38:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 22:38:12,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-03-03 22:38:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:12,033 INFO L225 Difference]: With dead ends: 702 [2025-03-03 22:38:12,033 INFO L226 Difference]: Without dead ends: 700 [2025-03-03 22:38:12,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:38:12,034 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 121 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:12,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1060 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:38:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-03 22:38:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 613. [2025-03-03 22:38:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 494 states have (on average 1.2995951417004048) internal successors, (642), 500 states have internal predecessors, (642), 104 states have call successors, (104), 14 states have call predecessors, (104), 14 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-03 22:38:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 850 transitions. [2025-03-03 22:38:12,062 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 850 transitions. Word has length 136 [2025-03-03 22:38:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:12,063 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 850 transitions. [2025-03-03 22:38:12,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 850 transitions. [2025-03-03 22:38:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 22:38:12,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:12,064 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:12,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 22:38:12,064 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:12,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash -191452397, now seen corresponding path program 1 times [2025-03-03 22:38:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:12,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052674592] [2025-03-03 22:38:12,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:12,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 22:38:12,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 22:38:12,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:12,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:12,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:12,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052674592] [2025-03-03 22:38:12,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052674592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:12,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:12,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:38:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450384396] [2025-03-03 22:38:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:12,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:38:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:12,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:38:12,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:12,117 INFO L87 Difference]: Start difference. First operand 613 states and 850 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:12,177 INFO L93 Difference]: Finished difference Result 1366 states and 1910 transitions. [2025-03-03 22:38:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:38:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-03-03 22:38:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:12,184 INFO L225 Difference]: With dead ends: 1366 [2025-03-03 22:38:12,184 INFO L226 Difference]: Without dead ends: 756 [2025-03-03 22:38:12,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:12,186 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 90 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:12,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 267 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:38:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-03 22:38:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 666. [2025-03-03 22:38:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 523 states have (on average 1.2619502868068833) internal successors, (660), 531 states have internal predecessors, (660), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 22:38:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 908 transitions. [2025-03-03 22:38:12,221 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 908 transitions. Word has length 136 [2025-03-03 22:38:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:12,222 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 908 transitions. [2025-03-03 22:38:12,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 908 transitions. [2025-03-03 22:38:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 22:38:12,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:12,224 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:12,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 22:38:12,224 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:12,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 311438103, now seen corresponding path program 1 times [2025-03-03 22:38:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:12,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076426434] [2025-03-03 22:38:12,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:12,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 22:38:12,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 22:38:12,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:12,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:12,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:12,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076426434] [2025-03-03 22:38:12,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076426434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:12,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:12,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:38:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703803357] [2025-03-03 22:38:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:12,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:38:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:12,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:38:12,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:12,264 INFO L87 Difference]: Start difference. First operand 666 states and 908 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:12,325 INFO L93 Difference]: Finished difference Result 1501 states and 2026 transitions. [2025-03-03 22:38:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:38:12,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-03-03 22:38:12,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:12,330 INFO L225 Difference]: With dead ends: 1501 [2025-03-03 22:38:12,330 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 22:38:12,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:12,332 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:12,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 198 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:38:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 22:38:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 770. [2025-03-03 22:38:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 627 states have (on average 1.266347687400319) internal successors, (794), 635 states have internal predecessors, (794), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 22:38:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1042 transitions. [2025-03-03 22:38:12,367 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1042 transitions. Word has length 136 [2025-03-03 22:38:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:12,367 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1042 transitions. [2025-03-03 22:38:12,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1042 transitions. [2025-03-03 22:38:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 22:38:12,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:12,369 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 22:38:12,369 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash 734851561, now seen corresponding path program 1 times [2025-03-03 22:38:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19717589] [2025-03-03 22:38:12,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:12,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:38:12,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:38:12,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:12,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:12,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:12,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19717589] [2025-03-03 22:38:12,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19717589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:12,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:12,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:38:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498096637] [2025-03-03 22:38:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:12,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:38:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:12,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:38:12,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:12,402 INFO L87 Difference]: Start difference. First operand 770 states and 1042 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:12,459 INFO L93 Difference]: Finished difference Result 1571 states and 2118 transitions. [2025-03-03 22:38:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:38:12,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 22:38:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:12,463 INFO L225 Difference]: With dead ends: 1571 [2025-03-03 22:38:12,463 INFO L226 Difference]: Without dead ends: 804 [2025-03-03 22:38:12,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:38:12,464 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 22 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:12,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 189 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:38:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-03 22:38:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 768. [2025-03-03 22:38:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 625 states have (on average 1.2544) internal successors, (784), 633 states have internal predecessors, (784), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 22:38:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1032 transitions. [2025-03-03 22:38:12,500 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1032 transitions. Word has length 137 [2025-03-03 22:38:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:12,500 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1032 transitions. [2025-03-03 22:38:12,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1032 transitions. [2025-03-03 22:38:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 22:38:12,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:12,501 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:12,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 22:38:12,502 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:12,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1365946300, now seen corresponding path program 1 times [2025-03-03 22:38:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:12,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914904152] [2025-03-03 22:38:12,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:12,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:38:12,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:38:12,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:12,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:12,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914904152] [2025-03-03 22:38:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914904152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:12,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:12,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:38:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14831788] [2025-03-03 22:38:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:38:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:12,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:38:12,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:38:12,567 INFO L87 Difference]: Start difference. First operand 768 states and 1032 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:12,733 INFO L93 Difference]: Finished difference Result 1788 states and 2347 transitions. [2025-03-03 22:38:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:38:12,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 22:38:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:12,738 INFO L225 Difference]: With dead ends: 1788 [2025-03-03 22:38:12,738 INFO L226 Difference]: Without dead ends: 1023 [2025-03-03 22:38:12,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:38:12,740 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 195 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:12,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 350 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:38:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-03-03 22:38:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 749. [2025-03-03 22:38:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 606 states have (on average 1.2475247524752475) internal successors, (756), 614 states have internal predecessors, (756), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-03 22:38:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1004 transitions. [2025-03-03 22:38:12,793 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1004 transitions. Word has length 137 [2025-03-03 22:38:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:12,795 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1004 transitions. [2025-03-03 22:38:12,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1004 transitions. [2025-03-03 22:38:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 22:38:12,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:12,796 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:12,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 22:38:12,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:12,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:12,797 INFO L85 PathProgramCache]: Analyzing trace with hash -443511569, now seen corresponding path program 1 times [2025-03-03 22:38:12,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:12,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537030114] [2025-03-03 22:38:12,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:12,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:12,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 22:38:12,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 22:38:12,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:12,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:12,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:12,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537030114] [2025-03-03 22:38:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537030114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:38:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101890949] [2025-03-03 22:38:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:12,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:38:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:12,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:38:12,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:38:12,885 INFO L87 Difference]: Start difference. First operand 749 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:13,018 INFO L93 Difference]: Finished difference Result 1369 states and 1799 transitions. [2025-03-03 22:38:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:38:13,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-03 22:38:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:13,022 INFO L225 Difference]: With dead ends: 1369 [2025-03-03 22:38:13,022 INFO L226 Difference]: Without dead ends: 923 [2025-03-03 22:38:13,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:38:13,024 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:13,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 405 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:38:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-03 22:38:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 862. [2025-03-03 22:38:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 699 states have (on average 1.21173104434907) internal successors, (847), 711 states have internal predecessors, (847), 140 states have call successors, (140), 22 states have call predecessors, (140), 22 states have return successors, (140), 128 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 22:38:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1127 transitions. [2025-03-03 22:38:13,064 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1127 transitions. Word has length 138 [2025-03-03 22:38:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:13,064 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1127 transitions. [2025-03-03 22:38:13,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1127 transitions. [2025-03-03 22:38:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 22:38:13,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:13,065 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:13,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 22:38:13,065 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:13,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:13,066 INFO L85 PathProgramCache]: Analyzing trace with hash -736914576, now seen corresponding path program 1 times [2025-03-03 22:38:13,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:13,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126092077] [2025-03-03 22:38:13,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:13,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:13,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 22:38:13,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 22:38:13,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:13,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:13,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:13,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126092077] [2025-03-03 22:38:13,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126092077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:13,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:13,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:38:13,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029231711] [2025-03-03 22:38:13,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:13,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:38:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:13,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:38:13,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:38:13,305 INFO L87 Difference]: Start difference. First operand 862 states and 1127 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:13,609 INFO L93 Difference]: Finished difference Result 880 states and 1144 transitions. [2025-03-03 22:38:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:38:13,612 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-03 22:38:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:13,616 INFO L225 Difference]: With dead ends: 880 [2025-03-03 22:38:13,617 INFO L226 Difference]: Without dead ends: 878 [2025-03-03 22:38:13,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:38:13,619 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 86 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:13,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 966 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:38:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-03 22:38:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 844. [2025-03-03 22:38:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 681 states have (on average 1.2173274596182084) internal successors, (829), 693 states have internal predecessors, (829), 140 states have call successors, (140), 22 states have call predecessors, (140), 22 states have return successors, (140), 128 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 22:38:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1109 transitions. [2025-03-03 22:38:13,663 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1109 transitions. Word has length 138 [2025-03-03 22:38:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:13,664 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1109 transitions. [2025-03-03 22:38:13,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1109 transitions. [2025-03-03 22:38:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 22:38:13,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:13,665 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:13,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 22:38:13,665 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:13,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:13,666 INFO L85 PathProgramCache]: Analyzing trace with hash 909798128, now seen corresponding path program 1 times [2025-03-03 22:38:13,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:13,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038600450] [2025-03-03 22:38:13,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:13,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:13,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 22:38:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 22:38:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:38:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038600450] [2025-03-03 22:38:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038600450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:13,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:13,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:38:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197276815] [2025-03-03 22:38:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:13,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:38:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:13,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:38:13,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:38:13,953 INFO L87 Difference]: Start difference. First operand 844 states and 1109 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:14,290 INFO L93 Difference]: Finished difference Result 875 states and 1138 transitions. [2025-03-03 22:38:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:38:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-03 22:38:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:14,294 INFO L225 Difference]: With dead ends: 875 [2025-03-03 22:38:14,294 INFO L226 Difference]: Without dead ends: 873 [2025-03-03 22:38:14,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:38:14,295 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 85 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:14,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1088 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:38:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-03 22:38:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 826. [2025-03-03 22:38:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 666 states have (on average 1.2207207207207207) internal successors, (813), 677 states have internal predecessors, (813), 136 states have call successors, (136), 23 states have call predecessors, (136), 23 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 22:38:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1085 transitions. [2025-03-03 22:38:14,335 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1085 transitions. Word has length 138 [2025-03-03 22:38:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:14,335 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1085 transitions. [2025-03-03 22:38:14,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:38:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1085 transitions. [2025-03-03 22:38:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 22:38:14,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:14,337 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:14,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 22:38:14,337 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:14,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash -205020370, now seen corresponding path program 1 times [2025-03-03 22:38:14,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:14,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481277227] [2025-03-03 22:38:14,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:14,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:14,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 22:38:14,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 22:38:14,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:14,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:38:14,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:38:14,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481277227] [2025-03-03 22:38:14,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481277227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:38:14,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72331250] [2025-03-03 22:38:14,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:14,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:38:14,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:38:14,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:38:14,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:38:14,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 22:38:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 22:38:14,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:14,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:14,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:38:14,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:38:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 22:38:14,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:38:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72331250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:14,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:38:14,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-03-03 22:38:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521282928] [2025-03-03 22:38:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:14,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:38:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:38:14,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:38:14,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:38:14,599 INFO L87 Difference]: Start difference. First operand 826 states and 1085 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:38:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:14,995 INFO L93 Difference]: Finished difference Result 1794 states and 2349 transitions. [2025-03-03 22:38:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 22:38:14,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 139 [2025-03-03 22:38:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:14,999 INFO L225 Difference]: With dead ends: 1794 [2025-03-03 22:38:14,999 INFO L226 Difference]: Without dead ends: 971 [2025-03-03 22:38:15,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 22:38:15,002 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 173 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:15,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 491 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:38:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-03 22:38:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 856. [2025-03-03 22:38:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 686 states have (on average 1.1822157434402332) internal successors, (811), 697 states have internal predecessors, (811), 140 states have call successors, (140), 29 states have call predecessors, (140), 29 states have return successors, (140), 129 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 22:38:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1091 transitions. [2025-03-03 22:38:15,065 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1091 transitions. Word has length 139 [2025-03-03 22:38:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:15,066 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1091 transitions. [2025-03-03 22:38:15,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:38:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1091 transitions. [2025-03-03 22:38:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:38:15,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:15,067 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:15,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:38:15,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 22:38:15,271 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:15,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2096452623, now seen corresponding path program 1 times [2025-03-03 22:38:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:38:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746245753] [2025-03-03 22:38:15,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:38:15,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:38:15,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:38:15,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:15,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:38:15,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:38:15,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:38:15,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:38:15,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:15,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:38:15,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:38:15,332 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:38:15,333 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:38:15,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 22:38:15,336 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, 1, 1, 1] [2025-03-03 22:38:15,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:38:15,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:38:15 BoogieIcfgContainer [2025-03-03 22:38:15,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:38:15,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:38:15,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:38:15,382 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:38:15,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:37:13" (3/4) ... [2025-03-03 22:38:15,383 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:38:15,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:38:15,384 INFO L158 Benchmark]: Toolchain (without parser) took 62879.47ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 123.2MB in the beginning and 800.4MB in the end (delta: -677.2MB). Peak memory consumption was 383.8MB. Max. memory is 16.1GB. [2025-03-03 22:38:15,384 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:38:15,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.93ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 109.8MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:38:15,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.10ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 106.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:38:15,385 INFO L158 Benchmark]: Boogie Preprocessor took 32.62ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 101.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:38:15,385 INFO L158 Benchmark]: IcfgBuilder took 365.25ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 79.0MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:38:15,385 INFO L158 Benchmark]: TraceAbstraction took 62234.30ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 78.1MB in the beginning and 800.7MB in the end (delta: -722.6MB). Peak memory consumption was 333.5MB. Max. memory is 16.1GB. [2025-03-03 22:38:15,385 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 1.2GB. Free memory was 800.7MB in the beginning and 800.4MB in the end (delta: 258.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:38:15,386 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.31ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.93ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 109.8MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.10ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 106.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.62ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 101.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 365.25ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 79.0MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 62234.30ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 78.1MB in the beginning and 800.7MB in the end (delta: -722.6MB). Peak memory consumption was 333.5MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 1.2GB. Free memory was 800.7MB in the beginning and 800.4MB in the end (delta: 258.4kB). Peak memory consumption was 8.4MB. 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 shiftRight at line 40, overapproximation of shiftRight at line 107, overapproximation of shiftLeft at line 49, overapproximation of shiftLeft at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] signed long int var_1_9 = 10; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] signed long int var_1_13 = 99; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; VAL [isInitial=0, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_7=2, var_1_8=8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_7=2, var_1_8=8, var_1_9=10] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=2, var_1_8=8, var_1_9=10] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=2, var_1_8=8, var_1_9=10] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_8=8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_8=8, var_1_9=10] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=8, var_1_9=10] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=8, var_1_9=10] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_9=10] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_9=10] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L93] var_1_13 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L94] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L95] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L96] var_1_17 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L98] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L99] var_1_18 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L100] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L101] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L115] RET updateVariables() [L116] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L40] COND FALSE !((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) [L43] var_1_1 = (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L45] COND TRUE (var_1_8 + var_1_1) >= var_1_7 [L46] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L49] COND TRUE var_1_1 >= (var_1_8 << var_1_3) [L50] COND TRUE var_1_6 > var_1_7 [L51] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=0, stepLocal_1=127, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L63] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=0, stepLocal_1=127, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L107] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L107] EXPR (var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L107] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L107] EXPR (var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L107] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L107-L108] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=127, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=66, var_1_3=1, var_1_5=128, var_1_6=127, var_1_7=65, var_1_8=64, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.1s, OverallIterations: 25, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1935 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1916 mSDsluCounter, 9996 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7176 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4229 IncrementalHoareTripleChecker+Invalid, 4476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 2820 mSDtfsCounter, 4229 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=862occurred in iteration=21, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 1378 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 53.7s InterpolantComputationTime, 3610 NumberOfCodeBlocks, 3610 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3444 ConstructedInterpolants, 0 QuantifiedInterpolants, 16439 SizeOfPredicates, 1 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 26 InterpolantComputations, 24 PerfectInterpolantSequences, 19719/19760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:38:15,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:38:17,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:38:17,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:38:17,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:38:17,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:38:17,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:38:17,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:38:17,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:38:17,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:38:17,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:38:17,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:38:17,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:38:17,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:38:17,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:38:17,281 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:38:17,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:38:17,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:38:17,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:38:17,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:38:17,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:38:17,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:38:17,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:38:17,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:38:17,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:38:17,283 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:38:17,284 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:38:17,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:38:17,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:38:17,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:38:17,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:38:17,284 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 [2025-03-03 22:38:17,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:38:17,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:38:17,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:38:17,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:38:17,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:38:17,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-03 22:38:18,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253f2bb2c/004fe502452b40b2b1075e4986683284/FLAG3c47399d0 [2025-03-03 22:38:18,836 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:38:18,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-03 22:38:18,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253f2bb2c/004fe502452b40b2b1075e4986683284/FLAG3c47399d0 [2025-03-03 22:38:19,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253f2bb2c/004fe502452b40b2b1075e4986683284 [2025-03-03 22:38:19,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:38:19,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:38:19,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:38:19,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:38:19,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:38:19,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7966e18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19, skipping insertion in model container [2025-03-03 22:38:19,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:38:19,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i[916,929] [2025-03-03 22:38:19,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:38:19,344 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:38:19,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i[916,929] [2025-03-03 22:38:19,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:38:19,385 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:38:19,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19 WrapperNode [2025-03-03 22:38:19,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:38:19,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:38:19,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:38:19,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:38:19,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,422 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2025-03-03 22:38:19,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:38:19,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:38:19,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:38:19,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:38:19,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,452 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:38:19,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:38:19,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:38:19,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:38:19,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:38:19,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (1/1) ... [2025-03-03 22:38:19,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:38:19,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:38:19,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:38:19,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:38:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:38:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:38:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:38:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:38:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:38:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:38:19,572 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:38:19,573 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:38:19,755 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:38:19,755 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:38:19,765 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:38:19,765 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:38:19,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:19 BoogieIcfgContainer [2025-03-03 22:38:19,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:38:19,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:38:19,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:38:19,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:38:19,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:38:19" (1/3) ... [2025-03-03 22:38:19,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c60f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:38:19, skipping insertion in model container [2025-03-03 22:38:19,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:19" (2/3) ... [2025-03-03 22:38:19,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c60f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:38:19, skipping insertion in model container [2025-03-03 22:38:19,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:19" (3/3) ... [2025-03-03 22:38:19,774 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-03 22:38:19,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:38:19,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-56.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:38:19,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:38:19,844 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;@612a1afb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:38:19,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:38:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:38:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 22:38:19,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:19,855 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:19,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:19,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1520021368, now seen corresponding path program 1 times [2025-03-03 22:38:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:38:19,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957930787] [2025-03-03 22:38:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:19,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:38:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:38:19,869 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:38:19,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:38:19,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 22:38:19,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 22:38:19,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:19,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:19,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:38:19,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:38:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:38:20,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:38:20,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:38:20,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957930787] [2025-03-03 22:38:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957930787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:38:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:38:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:38:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241219034] [2025-03-03 22:38:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:38:20,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:38:20,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:38:20,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:38:20,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:38:20,021 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:38:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:38:20,035 INFO L93 Difference]: Finished difference Result 108 states and 187 transitions. [2025-03-03 22:38:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:38:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2025-03-03 22:38:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:38:20,040 INFO L225 Difference]: With dead ends: 108 [2025-03-03 22:38:20,040 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 22:38:20,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:38:20,044 INFO L435 NwaCegarLoop]: 81 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, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:38:20,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:38:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 22:38:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 22:38:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:38:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2025-03-03 22:38:20,069 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 124 [2025-03-03 22:38:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:38:20,069 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2025-03-03 22:38:20,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:38:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2025-03-03 22:38:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 22:38:20,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:38:20,075 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:38:20,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:38:20,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:38:20,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:38:20,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:38:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 648289416, now seen corresponding path program 1 times [2025-03-03 22:38:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:38:20,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297660869] [2025-03-03 22:38:20,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:38:20,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:38:20,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:38:20,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:38:20,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:38:20,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 22:38:20,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 22:38:20,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:38:20,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:20,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 22:38:20,373 INFO L279 TraceCheckSpWp]: Computing forward predicates...