./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.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_operatoramount_amount100_file-61.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 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:57:30,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:57:30,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:57:30,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:57:30,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:57:30,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:57:30,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:57:30,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:57:30,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:57:30,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:57:30,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:57:30,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:57:30,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:57:30,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:57:30,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:57:30,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:57:30,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:57:30,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:57:30,623 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:57:30,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:57:30,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:57:30,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:57:30,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:57:30,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:57:30,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:30,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:57:30,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:57:30,624 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 -> 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 [2025-03-03 23:57:30,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:57:30,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:57:30,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:57:30,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:57:30,857 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:57:30,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2025-03-03 23:57:31,959 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729cf19ec/3bd5d02150774d51b9d54af276b7e264/FLAG283c418ac [2025-03-03 23:57:32,200 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:57:32,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2025-03-03 23:57:32,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729cf19ec/3bd5d02150774d51b9d54af276b7e264/FLAG283c418ac [2025-03-03 23:57:32,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729cf19ec/3bd5d02150774d51b9d54af276b7e264 [2025-03-03 23:57:32,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:57:32,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:57:32,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:32,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:57:32,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:57:32,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740d2ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32, skipping insertion in model container [2025-03-03 23:57:32,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:57:32,647 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_operatoramount_amount100_file-61.i[916,929] [2025-03-03 23:57:32,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:32,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:57:32,756 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_operatoramount_amount100_file-61.i[916,929] [2025-03-03 23:57:32,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:32,818 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:57:32,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32 WrapperNode [2025-03-03 23:57:32,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:32,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:32,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:57:32,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:57:32,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,884 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2025-03-03 23:57:32,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:32,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:57:32,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:57:32,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:57:32,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,928 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 23:57:32,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:57:32,954 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:57:32,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:57:32,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:57:32,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (1/1) ... [2025-03-03 23:57:32,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:32,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:32,978 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 23:57:32,984 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 23:57:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:57:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:57:32,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:57:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:57:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:57:33,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:57:33,053 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:57:33,055 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:57:33,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise20#1;havoc property_#t~short21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2025-03-03 23:57:33,414 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-03 23:57:33,414 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:57:33,430 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:57:33,431 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:57:33,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:33 BoogieIcfgContainer [2025-03-03 23:57:33,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:57:33,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:57:33,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:57:33,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:57:33,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:57:32" (1/3) ... [2025-03-03 23:57:33,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223a2ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:33, skipping insertion in model container [2025-03-03 23:57:33,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:32" (2/3) ... [2025-03-03 23:57:33,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223a2ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:33, skipping insertion in model container [2025-03-03 23:57:33,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:33" (3/3) ... [2025-03-03 23:57:33,439 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-61.i [2025-03-03 23:57:33,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:57:33,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-61.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:57:33,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:57:33,502 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;@13c33fb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:57:33,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:57:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 23:57:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 23:57:33,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:33,517 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:33,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:33,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1838748449, now seen corresponding path program 1 times [2025-03-03 23:57:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:33,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505854025] [2025-03-03 23:57:33,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:33,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 23:57:33,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 23:57:33,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:33,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 23:57:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505854025] [2025-03-03 23:57:33,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505854025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074983497] [2025-03-03 23:57:33,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:33,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:33,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:33,835 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 23:57:33,837 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 23:57:33,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 23:57:33,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 23:57:33,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:33,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:33,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:57:33,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 23:57:34,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:57:34,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074983497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:34,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:57:34,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:57:34,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405197881] [2025-03-03 23:57:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:34,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:57:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:34,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:57:34,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:34,048 INFO L87 Difference]: Start difference. First operand has 105 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 23:57:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:34,082 INFO L93 Difference]: Finished difference Result 204 states and 349 transitions. [2025-03-03 23:57:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:57:34,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2025-03-03 23:57:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:34,091 INFO L225 Difference]: With dead ends: 204 [2025-03-03 23:57:34,091 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 23:57:34,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:34,096 INFO L435 NwaCegarLoop]: 155 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, 155 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 23:57:34,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 23:57:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-03 23:57:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 23:57:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2025-03-03 23:57:34,139 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 175 [2025-03-03 23:57:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:34,142 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2025-03-03 23:57:34,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 23:57:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2025-03-03 23:57:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 23:57:34,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:34,146 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:34,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:57:34,347 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 23:57:34,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1682742147, now seen corresponding path program 1 times [2025-03-03 23:57:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328223003] [2025-03-03 23:57:34,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:34,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 23:57:34,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 23:57:34,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:34,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:57:38,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:38,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328223003] [2025-03-03 23:57:38,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328223003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:38,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:38,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:57:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084183984] [2025-03-03 23:57:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:38,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:57:38,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:38,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:57:38,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:57:38,765 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:40,501 INFO L93 Difference]: Finished difference Result 473 states and 739 transitions. [2025-03-03 23:57:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:57:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-03 23:57:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:40,506 INFO L225 Difference]: With dead ends: 473 [2025-03-03 23:57:40,509 INFO L226 Difference]: Without dead ends: 374 [2025-03-03 23:57:40,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:57:40,513 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 903 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:40,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 680 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 23:57:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-03 23:57:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 169. [2025-03-03 23:57:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 267 transitions. [2025-03-03 23:57:40,539 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 267 transitions. Word has length 175 [2025-03-03 23:57:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:40,539 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 267 transitions. [2025-03-03 23:57:40,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 267 transitions. [2025-03-03 23:57:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 23:57:40,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:40,543 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:40,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:57:40,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:40,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2101690972, now seen corresponding path program 1 times [2025-03-03 23:57:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633611906] [2025-03-03 23:57:40,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:40,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 23:57:40,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 23:57:40,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:40,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:57:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:40,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633611906] [2025-03-03 23:57:40,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633611906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:40,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:40,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:57:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041065681] [2025-03-03 23:57:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:40,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:57:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:40,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:57:40,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:40,737 INFO L87 Difference]: Start difference. First operand 169 states and 267 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:40,791 INFO L93 Difference]: Finished difference Result 276 states and 429 transitions. [2025-03-03 23:57:40,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:57:40,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-03 23:57:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:40,795 INFO L225 Difference]: With dead ends: 276 [2025-03-03 23:57:40,796 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 23:57:40,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 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 23:57:40,798 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 94 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:40,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 177 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 23:57:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-03 23:57:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 271 transitions. [2025-03-03 23:57:40,822 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 271 transitions. Word has length 175 [2025-03-03 23:57:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:40,823 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 271 transitions. [2025-03-03 23:57:40,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 271 transitions. [2025-03-03 23:57:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:57:40,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:40,826 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:40,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:57:40,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1989498030, now seen corresponding path program 1 times [2025-03-03 23:57:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694951116] [2025-03-03 23:57:40,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:40,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:57:40,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:57:40,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:40,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:57:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694951116] [2025-03-03 23:57:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694951116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:42,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:42,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:57:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752590997] [2025-03-03 23:57:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:42,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:57:42,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:42,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:57:42,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:57:42,177 INFO L87 Difference]: Start difference. First operand 177 states and 271 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:43,113 INFO L93 Difference]: Finished difference Result 466 states and 715 transitions. [2025-03-03 23:57:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:57:43,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-03 23:57:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:43,115 INFO L225 Difference]: With dead ends: 466 [2025-03-03 23:57:43,115 INFO L226 Difference]: Without dead ends: 363 [2025-03-03 23:57:43,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:57:43,116 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 720 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:43,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 543 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:57:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-03 23:57:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 196. [2025-03-03 23:57:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.4316546762589928) internal successors, (199), 139 states have internal predecessors, (199), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 303 transitions. [2025-03-03 23:57:43,145 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 303 transitions. Word has length 176 [2025-03-03 23:57:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:43,146 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 303 transitions. [2025-03-03 23:57:43,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 303 transitions. [2025-03-03 23:57:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:57:43,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:43,148 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:57:43,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:43,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2012066259, now seen corresponding path program 1 times [2025-03-03 23:57:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811644991] [2025-03-03 23:57:43,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:43,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:57:43,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:57:43,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:43,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:57:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:44,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811644991] [2025-03-03 23:57:44,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811644991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:57:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815926082] [2025-03-03 23:57:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:57:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:44,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:57:44,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:57:44,193 INFO L87 Difference]: Start difference. First operand 196 states and 303 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:45,250 INFO L93 Difference]: Finished difference Result 478 states and 727 transitions. [2025-03-03 23:57:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 23:57:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-03 23:57:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:45,253 INFO L225 Difference]: With dead ends: 478 [2025-03-03 23:57:45,253 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 23:57:45,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2025-03-03 23:57:45,254 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 771 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:45,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 726 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:57:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 23:57:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2025-03-03 23:57:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 168 states have (on average 1.4642857142857142) internal successors, (246), 168 states have internal predecessors, (246), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 350 transitions. [2025-03-03 23:57:45,274 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 350 transitions. Word has length 176 [2025-03-03 23:57:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:45,274 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 350 transitions. [2025-03-03 23:57:45,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 350 transitions. [2025-03-03 23:57:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 23:57:45,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:45,276 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:57:45,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash -216171215, now seen corresponding path program 1 times [2025-03-03 23:57:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714364808] [2025-03-03 23:57:45,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:45,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:45,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 23:57:45,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 23:57:45,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:45,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:57:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714364808] [2025-03-03 23:57:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714364808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:45,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:45,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:57:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340468820] [2025-03-03 23:57:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:57:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:45,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:57:45,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:57:45,503 INFO L87 Difference]: Start difference. First operand 225 states and 350 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:45,638 INFO L93 Difference]: Finished difference Result 358 states and 557 transitions. [2025-03-03 23:57:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:57:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-03-03 23:57:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:45,640 INFO L225 Difference]: With dead ends: 358 [2025-03-03 23:57:45,640 INFO L226 Difference]: Without dead ends: 221 [2025-03-03 23:57:45,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:57:45,641 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 131 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:45,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 308 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:57:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-03 23:57:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-03-03 23:57:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.4451219512195121) internal successors, (237), 164 states have internal predecessors, (237), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2025-03-03 23:57:45,657 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 341 transitions. Word has length 178 [2025-03-03 23:57:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:45,657 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 341 transitions. [2025-03-03 23:57:45,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 341 transitions. [2025-03-03 23:57:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 23:57:45,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:45,659 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:45,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:57:45,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:45,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2144123014, now seen corresponding path program 1 times [2025-03-03 23:57:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:45,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127213660] [2025-03-03 23:57:45,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:45,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 23:57:45,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 23:57:45,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:45,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:57:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127213660] [2025-03-03 23:57:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127213660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004206288] [2025-03-03 23:57:45,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:45,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:45,864 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 23:57:45,865 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 23:57:45,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 23:57:45,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 23:57:45,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:45,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:45,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:57:45,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 23:57:46,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:57:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:57:46,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004206288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:57:46,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:57:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-03 23:57:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435495258] [2025-03-03 23:57:46,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:57:46,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:57:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:46,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:57:46,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:57:46,440 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2025-03-03 23:57:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:46,593 INFO L93 Difference]: Finished difference Result 348 states and 522 transitions. [2025-03-03 23:57:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:57:46,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) Word has length 180 [2025-03-03 23:57:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:46,595 INFO L225 Difference]: With dead ends: 348 [2025-03-03 23:57:46,596 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 23:57:46,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:57:46,598 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 67 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:46,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 280 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:57:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 23:57:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2025-03-03 23:57:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.389937106918239) internal successors, (221), 159 states have internal predecessors, (221), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 325 transitions. [2025-03-03 23:57:46,614 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 325 transitions. Word has length 180 [2025-03-03 23:57:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:46,615 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 325 transitions. [2025-03-03 23:57:46,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2025-03-03 23:57:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 325 transitions. [2025-03-03 23:57:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 23:57:46,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:46,617 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:46,624 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 23:57:46,817 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,SelfDestructingSolverStorable6 [2025-03-03 23:57:46,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:46,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1799865630, now seen corresponding path program 1 times [2025-03-03 23:57:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523180528] [2025-03-03 23:57:46,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:46,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 23:57:46,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 23:57:46,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:46,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:57:46,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:46,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523180528] [2025-03-03 23:57:46,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523180528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:46,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:46,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:57:46,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521972012] [2025-03-03 23:57:46,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:46,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:57:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:46,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:57:46,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:57:46,990 INFO L87 Difference]: Start difference. First operand 218 states and 325 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:47,161 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2025-03-03 23:57:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:57:47,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2025-03-03 23:57:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:47,164 INFO L225 Difference]: With dead ends: 493 [2025-03-03 23:57:47,164 INFO L226 Difference]: Without dead ends: 332 [2025-03-03 23:57:47,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:57:47,165 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 144 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:47,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 764 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:57:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-03 23:57:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 266. [2025-03-03 23:57:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2025-03-03 23:57:47,183 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 180 [2025-03-03 23:57:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:47,183 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2025-03-03 23:57:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2025-03-03 23:57:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 23:57:47,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:47,185 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:47,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 23:57:47,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash -458960851, now seen corresponding path program 1 times [2025-03-03 23:57:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499322175] [2025-03-03 23:57:47,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:47,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 23:57:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 23:57:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:47,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:57:47,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:47,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499322175] [2025-03-03 23:57:47,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499322175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:47,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:47,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:57:47,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661314364] [2025-03-03 23:57:47,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:47,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:57:47,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:47,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:57:47,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:47,255 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:47,306 INFO L93 Difference]: Finished difference Result 467 states and 692 transitions. [2025-03-03 23:57:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:57:47,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2025-03-03 23:57:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:47,308 INFO L225 Difference]: With dead ends: 467 [2025-03-03 23:57:47,308 INFO L226 Difference]: Without dead ends: 335 [2025-03-03 23:57:47,309 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 23:57:47,309 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 47 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:47,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 289 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-03 23:57:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 314. [2025-03-03 23:57:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 255 states have (on average 1.4392156862745098) internal successors, (367), 255 states have internal predecessors, (367), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 471 transitions. [2025-03-03 23:57:47,323 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 471 transitions. Word has length 180 [2025-03-03 23:57:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:47,323 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 471 transitions. [2025-03-03 23:57:47,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 471 transitions. [2025-03-03 23:57:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 23:57:47,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:47,325 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:47,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 23:57:47,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:47,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 271180857, now seen corresponding path program 1 times [2025-03-03 23:57:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346775189] [2025-03-03 23:57:47,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:47,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 23:57:47,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 23:57:47,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:47,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:57:47,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346775189] [2025-03-03 23:57:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346775189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:47,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:57:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921539509] [2025-03-03 23:57:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:47,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:57:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:47,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:57:47,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:57:47,490 INFO L87 Difference]: Start difference. First operand 314 states and 471 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:47,646 INFO L93 Difference]: Finished difference Result 642 states and 963 transitions. [2025-03-03 23:57:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:57:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2025-03-03 23:57:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:47,649 INFO L225 Difference]: With dead ends: 642 [2025-03-03 23:57:47,649 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 23:57:47,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:57:47,651 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 213 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:47,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 504 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:57:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 23:57:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 288. [2025-03-03 23:57:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 229 states have (on average 1.4148471615720524) internal successors, (324), 229 states have internal predecessors, (324), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 428 transitions. [2025-03-03 23:57:47,670 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 428 transitions. Word has length 180 [2025-03-03 23:57:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:47,670 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 428 transitions. [2025-03-03 23:57:47,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:57:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 428 transitions. [2025-03-03 23:57:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 23:57:47,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:47,672 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:47,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:57:47,673 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:47,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash -246718605, now seen corresponding path program 1 times [2025-03-03 23:57:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:47,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544713473] [2025-03-03 23:57:47,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:47,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 23:57:47,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 23:57:47,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:47,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:57:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544713473] [2025-03-03 23:57:47,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544713473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661588706] [2025-03-03 23:57:47,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:47,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:47,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:47,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:57:48,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:57:48,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 23:57:48,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 23:57:48,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:48,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 23:57:48,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-03-03 23:57:48,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:57:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:57:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661588706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:57:48,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:57:48,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-03-03 23:57:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159483674] [2025-03-03 23:57:48,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:57:48,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 23:57:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:48,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 23:57:48,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:57:48,866 INFO L87 Difference]: Start difference. First operand 288 states and 428 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2025-03-03 23:57:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:49,786 INFO L93 Difference]: Finished difference Result 696 states and 1003 transitions. [2025-03-03 23:57:49,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 23:57:49,786 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) Word has length 181 [2025-03-03 23:57:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:49,789 INFO L225 Difference]: With dead ends: 696 [2025-03-03 23:57:49,789 INFO L226 Difference]: Without dead ends: 444 [2025-03-03 23:57:49,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 23:57:49,791 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 416 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:49,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 749 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:57:49,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-03 23:57:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 272. [2025-03-03 23:57:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 211 states have internal predecessors, (280), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:57:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 384 transitions. [2025-03-03 23:57:49,811 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 384 transitions. Word has length 181 [2025-03-03 23:57:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:49,812 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 384 transitions. [2025-03-03 23:57:49,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2025-03-03 23:57:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 384 transitions. [2025-03-03 23:57:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 23:57:49,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:49,814 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:49,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 23:57:50,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:50,015 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:50,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 387790437, now seen corresponding path program 1 times [2025-03-03 23:57:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641264144] [2025-03-03 23:57:50,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:50,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 23:57:50,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 23:57:50,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:50,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat