./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-29.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_amount250_file-29.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 e794586f9f3740a193d413dfe816851463e703edc20a79bd19788c3a0505333b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:09:42,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:09:43,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:09:43,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:09:43,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:09:43,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:09:43,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:09:43,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:09:43,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:09:43,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:09:43,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:09:43,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:09:43,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:09:43,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:09:43,076 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:09:43,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:09:43,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:09:43,076 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:09:43,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:09:43,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:09:43,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:09:43,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:09:43,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:09:43,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:43,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:09:43,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:09:43,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:09:43,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:09:43,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:09:43,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:09:43,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:09:43,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:09:43,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:09:43,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:09:43,079 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 -> e794586f9f3740a193d413dfe816851463e703edc20a79bd19788c3a0505333b [2025-03-04 00:09:43,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:09:43,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:09:43,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:09:43,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:09:43,509 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:09:43,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-29.i [2025-03-04 00:09:45,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15da3c2c7/836a0530b06547a3be144b552bdb5058/FLAGb1766d913 [2025-03-04 00:09:45,589 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:09:45,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-29.i [2025-03-04 00:09:45,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15da3c2c7/836a0530b06547a3be144b552bdb5058/FLAGb1766d913 [2025-03-04 00:09:45,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15da3c2c7/836a0530b06547a3be144b552bdb5058 [2025-03-04 00:09:45,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:09:45,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:09:45,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:45,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:09:45,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:09:45,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:45" (1/1) ... [2025-03-04 00:09:45,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b72bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:45, skipping insertion in model container [2025-03-04 00:09:45,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:45" (1/1) ... [2025-03-04 00:09:45,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:09:45,918 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_amount250_file-29.i[916,929] [2025-03-04 00:09:46,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:46,141 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:09:46,158 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_amount250_file-29.i[916,929] [2025-03-04 00:09:46,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:46,285 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:09:46,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46 WrapperNode [2025-03-04 00:09:46,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:46,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:46,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:09:46,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:09:46,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,412 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2025-03-04 00:09:46,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:46,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:09:46,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:09:46,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:09:46,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,465 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-04 00:09:46,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:09:46,545 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:09:46,545 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:09:46,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:09:46,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (1/1) ... [2025-03-04 00:09:46,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:46,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:46,594 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-04 00:09:46,598 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-04 00:09:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:09:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:09:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:09:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:09:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:09:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:09:46,770 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:09:46,772 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:09:47,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L373: havoc property_#t~bitwise37#1;havoc property_#t~short38#1;havoc property_#t~bitwise39#1;havoc property_#t~short40#1; [2025-03-04 00:09:47,808 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-04 00:09:47,808 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:09:47,846 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:09:47,847 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:09:47,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:47 BoogieIcfgContainer [2025-03-04 00:09:47,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:09:47,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:09:47,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:09:47,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:09:47,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:09:45" (1/3) ... [2025-03-04 00:09:47,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ce9979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:47, skipping insertion in model container [2025-03-04 00:09:47,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:46" (2/3) ... [2025-03-04 00:09:47,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ce9979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:47, skipping insertion in model container [2025-03-04 00:09:47,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:47" (3/3) ... [2025-03-04 00:09:47,856 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-29.i [2025-03-04 00:09:47,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:09:47,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-29.i that has 2 procedures, 178 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:09:47,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:09:47,989 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;@82f01fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:09:47,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:09:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 00:09:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 00:09:48,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:48,034 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:48,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:48,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1276393586, now seen corresponding path program 1 times [2025-03-04 00:09:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550836727] [2025-03-04 00:09:48,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:48,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:48,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:48,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:48,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:48,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2025-03-04 00:09:48,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550836727] [2025-03-04 00:09:48,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550836727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:48,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539431908] [2025-03-04 00:09:48,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:48,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:48,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:48,820 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-04 00:09:48,822 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-04 00:09:48,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:49,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:49,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:49,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:49,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:09:49,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2025-03-04 00:09:49,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:09:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539431908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:49,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:09:49,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:09:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265463772] [2025-03-04 00:09:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:09:49,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:49,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:09:49,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:09:49,289 INFO L87 Difference]: Start difference. First operand has 178 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 00:09:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:49,375 INFO L93 Difference]: Finished difference Result 350 states and 622 transitions. [2025-03-04 00:09:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:09:49,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) Word has length 360 [2025-03-04 00:09:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:49,396 INFO L225 Difference]: With dead ends: 350 [2025-03-04 00:09:49,396 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 00:09:49,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 361 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-04 00:09:49,410 INFO L435 NwaCegarLoop]: 277 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, 277 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-04 00:09:49,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 00:09:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-04 00:09:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 118 states have internal predecessors, (171), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 00:09:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 281 transitions. [2025-03-04 00:09:49,490 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 281 transitions. Word has length 360 [2025-03-04 00:09:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:49,491 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 281 transitions. [2025-03-04 00:09:49,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 00:09:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 281 transitions. [2025-03-04 00:09:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 00:09:49,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:49,502 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:49,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:09:49,709 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-04 00:09:49,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash -817418795, now seen corresponding path program 1 times [2025-03-04 00:09:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905762321] [2025-03-04 00:09:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:49,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:49,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:49,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:49,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-04 00:09:50,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905762321] [2025-03-04 00:09:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905762321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:50,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708017830] [2025-03-04 00:09:50,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:50,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:50,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:50,401 INFO L87 Difference]: Start difference. First operand 175 states and 281 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-04 00:09:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:50,504 INFO L93 Difference]: Finished difference Result 422 states and 675 transitions. [2025-03-04 00:09:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:50,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-04 00:09:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:50,508 INFO L225 Difference]: With dead ends: 422 [2025-03-04 00:09:50,508 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 00:09:50,514 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-04 00:09:50,515 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 103 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:50,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 615 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 00:09:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2025-03-04 00:09:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 187 states have (on average 1.4973262032085561) internal successors, (280), 188 states have internal predecessors, (280), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 00:09:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 394 transitions. [2025-03-04 00:09:50,565 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 394 transitions. Word has length 360 [2025-03-04 00:09:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:50,567 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 394 transitions. [2025-03-04 00:09:50,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-04 00:09:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 394 transitions. [2025-03-04 00:09:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 00:09:50,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:50,577 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:09:50,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1541888214, now seen corresponding path program 1 times [2025-03-04 00:09:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:50,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772403506] [2025-03-04 00:09:50,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:50,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:50,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:50,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:50,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-04 00:09:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772403506] [2025-03-04 00:09:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772403506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:51,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:51,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:51,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347824861] [2025-03-04 00:09:51,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:51,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:51,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:51,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:51,308 INFO L87 Difference]: Start difference. First operand 247 states and 394 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-04 00:09:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:51,397 INFO L93 Difference]: Finished difference Result 735 states and 1176 transitions. [2025-03-04 00:09:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:51,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-04 00:09:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:51,402 INFO L225 Difference]: With dead ends: 735 [2025-03-04 00:09:51,402 INFO L226 Difference]: Without dead ends: 491 [2025-03-04 00:09:51,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:51,404 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 175 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:51,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 800 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-04 00:09:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2025-03-04 00:09:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 370 states have (on average 1.4972972972972973) internal successors, (554), 372 states have internal predecessors, (554), 114 states have call successors, (114), 4 states have call predecessors, (114), 4 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-04 00:09:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 782 transitions. [2025-03-04 00:09:51,480 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 782 transitions. Word has length 360 [2025-03-04 00:09:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:51,481 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 782 transitions. [2025-03-04 00:09:51,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-04 00:09:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 782 transitions. [2025-03-04 00:09:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 00:09:51,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:51,484 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:51,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:09:51,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:51,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1027598185, now seen corresponding path program 1 times [2025-03-04 00:09:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962127744] [2025-03-04 00:09:51,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:51,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:51,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:51,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:51,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-04 00:09:52,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:52,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962127744] [2025-03-04 00:09:52,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962127744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:52,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:52,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:09:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443781207] [2025-03-04 00:09:52,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:52,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:09:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:52,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:09:52,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:52,020 INFO L87 Difference]: Start difference. First operand 489 states and 782 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 00:09:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:52,465 INFO L93 Difference]: Finished difference Result 1465 states and 2348 transitions. [2025-03-04 00:09:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:09:52,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 360 [2025-03-04 00:09:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:52,473 INFO L225 Difference]: With dead ends: 1465 [2025-03-04 00:09:52,473 INFO L226 Difference]: Without dead ends: 979 [2025-03-04 00:09:52,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:09:52,475 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 285 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:52,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 890 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:09:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-04 00:09:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 977. [2025-03-04 00:09:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 740 states have (on average 1.4972972972972973) internal successors, (1108), 744 states have internal predecessors, (1108), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 224 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-04 00:09:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1564 transitions. [2025-03-04 00:09:52,606 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1564 transitions. Word has length 360 [2025-03-04 00:09:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:52,607 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1564 transitions. [2025-03-04 00:09:52,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-04 00:09:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1564 transitions. [2025-03-04 00:09:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 00:09:52,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:52,614 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:52,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:09:52,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:52,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1190159768, now seen corresponding path program 1 times [2025-03-04 00:09:52,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:52,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040387457] [2025-03-04 00:09:52,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:52,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:53,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:53,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:53,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-04 00:09:54,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040387457] [2025-03-04 00:09:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040387457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:54,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:09:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765456038] [2025-03-04 00:09:54,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:54,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:09:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:54,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:09:54,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:54,070 INFO L87 Difference]: Start difference. First operand 977 states and 1564 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-04 00:09:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:55,076 INFO L93 Difference]: Finished difference Result 3739 states and 5971 transitions. [2025-03-04 00:09:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:09:55,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-04 00:09:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:55,091 INFO L225 Difference]: With dead ends: 3739 [2025-03-04 00:09:55,091 INFO L226 Difference]: Without dead ends: 2765 [2025-03-04 00:09:55,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:09:55,096 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 319 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:55,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 825 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:09:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2025-03-04 00:09:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2277. [2025-03-04 00:09:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 1804 states have (on average 1.501108647450111) internal successors, (2708), 1812 states have internal predecessors, (2708), 456 states have call successors, (456), 16 states have call predecessors, (456), 16 states have return successors, (456), 448 states have call predecessors, (456), 456 states have call successors, (456) [2025-03-04 00:09:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3620 transitions. [2025-03-04 00:09:55,304 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3620 transitions. Word has length 360 [2025-03-04 00:09:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:55,305 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 3620 transitions. [2025-03-04 00:09:55,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-04 00:09:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3620 transitions. [2025-03-04 00:09:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 00:09:55,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:55,312 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:55,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:09:55,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:55,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1201475895, now seen corresponding path program 1 times [2025-03-04 00:09:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840364108] [2025-03-04 00:09:55,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:55,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:55,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:55,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:55,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 129 proven. 33 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2025-03-04 00:09:56,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840364108] [2025-03-04 00:09:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840364108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369495056] [2025-03-04 00:09:56,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:56,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:56,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:56,331 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-04 00:09:56,333 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-04 00:09:56,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:56,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:56,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:56,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:56,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:09:56,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2032 proven. 33 refuted. 0 times theorem prover too weak. 3875 trivial. 0 not checked. [2025-03-04 00:09:56,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 129 proven. 33 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2025-03-04 00:09:57,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369495056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:57,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:57,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-04 00:09:57,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889931344] [2025-03-04 00:09:57,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:57,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:09:57,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:57,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:09:57,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:09:57,335 INFO L87 Difference]: Start difference. First operand 2277 states and 3620 transitions. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:09:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:58,908 INFO L93 Difference]: Finished difference Result 9243 states and 14562 transitions. [2025-03-04 00:09:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 00:09:58,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 360 [2025-03-04 00:09:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:58,941 INFO L225 Difference]: With dead ends: 9243 [2025-03-04 00:09:58,941 INFO L226 Difference]: Without dead ends: 6969 [2025-03-04 00:09:58,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 716 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=634, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:09:58,949 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 1002 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:58,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1296 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:09:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6969 states. [2025-03-04 00:09:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6969 to 2793. [2025-03-04 00:09:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2793 states, 2209 states have (on average 1.496152105024898) internal successors, (3305), 2220 states have internal predecessors, (3305), 556 states have call successors, (556), 27 states have call predecessors, (556), 27 states have return successors, (556), 545 states have call predecessors, (556), 556 states have call successors, (556) [2025-03-04 00:09:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 4417 transitions. [2025-03-04 00:09:59,280 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 4417 transitions. Word has length 360 [2025-03-04 00:09:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:59,281 INFO L471 AbstractCegarLoop]: Abstraction has 2793 states and 4417 transitions. [2025-03-04 00:09:59,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:09:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 4417 transitions. [2025-03-04 00:09:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 00:09:59,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:59,288 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:59,299 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-04 00:09:59,489 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,SelfDestructingSolverStorable5 [2025-03-04 00:09:59,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1412826808, now seen corresponding path program 1 times [2025-03-04 00:09:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:59,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697564653] [2025-03-04 00:09:59,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:59,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:09:59,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:09:59,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:59,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 108 proven. 54 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2025-03-04 00:10:00,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:00,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697564653] [2025-03-04 00:10:00,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697564653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:00,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474852652] [2025-03-04 00:10:00,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:00,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:00,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:00,514 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-04 00:10:00,516 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-04 00:10:00,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-04 00:10:00,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 00:10:00,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:00,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:00,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 00:10:00,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2738 proven. 102 refuted. 0 times theorem prover too weak. 3100 trivial. 0 not checked. [2025-03-04 00:10:02,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 108 proven. 54 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2025-03-04 00:10:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474852652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:03,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 21 [2025-03-04 00:10:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069291321] [2025-03-04 00:10:03,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:03,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 00:10:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:03,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 00:10:03,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:10:03,370 INFO L87 Difference]: Start difference. First operand 2793 states and 4417 transitions. Second operand has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 20 states have internal predecessors, (226), 6 states have call successors, (165), 4 states have call predecessors, (165), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) [2025-03-04 00:10:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:06,164 INFO L93 Difference]: Finished difference Result 7594 states and 11939 transitions. [2025-03-04 00:10:06,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 00:10:06,168 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 20 states have internal predecessors, (226), 6 states have call successors, (165), 4 states have call predecessors, (165), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) Word has length 360 [2025-03-04 00:10:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:06,202 INFO L225 Difference]: With dead ends: 7594 [2025-03-04 00:10:06,204 INFO L226 Difference]: Without dead ends: 4873 [2025-03-04 00:10:06,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2025-03-04 00:10:06,235 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 339 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:06,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1802 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 00:10:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2025-03-04 00:10:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4829. [2025-03-04 00:10:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4829 states, 3825 states have (on average 1.4852287581699346) internal successors, (5681), 3848 states have internal predecessors, (5681), 936 states have call successors, (936), 67 states have call predecessors, (936), 67 states have return successors, (936), 913 states have call predecessors, (936), 936 states have call successors, (936) [2025-03-04 00:10:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4829 states to 4829 states and 7553 transitions. [2025-03-04 00:10:06,804 INFO L78 Accepts]: Start accepts. Automaton has 4829 states and 7553 transitions. Word has length 360 [2025-03-04 00:10:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:06,804 INFO L471 AbstractCegarLoop]: Abstraction has 4829 states and 7553 transitions. [2025-03-04 00:10:06,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 20 states have internal predecessors, (226), 6 states have call successors, (165), 4 states have call predecessors, (165), 7 states have return successors, (165), 6 states have call predecessors, (165), 6 states have call successors, (165) [2025-03-04 00:10:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4829 states and 7553 transitions. [2025-03-04 00:10:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-04 00:10:06,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:06,812 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:06,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:07,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:07,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash 603695578, now seen corresponding path program 1 times [2025-03-04 00:10:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246815915] [2025-03-04 00:10:07,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:07,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:07,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-04 00:10:07,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-04 00:10:07,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:07,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 153 proven. 9 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2025-03-04 00:10:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246815915] [2025-03-04 00:10:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246815915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005986449] [2025-03-04 00:10:08,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:08,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:08,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:08,829 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:08,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:10:09,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-04 00:10:09,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-04 00:10:09,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:09,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:09,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 00:10:09,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 3825 proven. 330 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2025-03-04 00:10:10,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 282 proven. 348 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2025-03-04 00:10:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005986449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:11,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 16] total 34 [2025-03-04 00:10:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738502122] [2025-03-04 00:10:11,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 00:10:11,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:11,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 00:10:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:10:11,638 INFO L87 Difference]: Start difference. First operand 4829 states and 7553 transitions. Second operand has 34 states, 32 states have (on average 7.4375) internal successors, (238), 30 states have internal predecessors, (238), 12 states have call successors, (146), 5 states have call predecessors, (146), 11 states have return successors, (147), 12 states have call predecessors, (147), 12 states have call successors, (147) [2025-03-04 00:10:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:26,142 INFO L93 Difference]: Finished difference Result 32721 states and 49089 transitions. [2025-03-04 00:10:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2025-03-04 00:10:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 7.4375) internal successors, (238), 30 states have internal predecessors, (238), 12 states have call successors, (146), 5 states have call predecessors, (146), 11 states have return successors, (147), 12 states have call predecessors, (147), 12 states have call successors, (147) Word has length 361 [2025-03-04 00:10:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:26,248 INFO L225 Difference]: With dead ends: 32721 [2025-03-04 00:10:26,248 INFO L226 Difference]: Without dead ends: 27972 [2025-03-04 00:10:26,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30948 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=12205, Invalid=59351, Unknown=0, NotChecked=0, Total=71556 [2025-03-04 00:10:26,281 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 6132 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 5161 mSolverCounterSat, 2176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6150 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 7337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2176 IncrementalHoareTripleChecker+Valid, 5161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:26,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6150 Valid, 3881 Invalid, 7337 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2176 Valid, 5161 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-04 00:10:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27972 states. [2025-03-04 00:10:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27972 to 14221. [2025-03-04 00:10:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14221 states, 12048 states have (on average 1.486968791500664) internal successors, (17915), 12141 states have internal predecessors, (17915), 1881 states have call successors, (1881), 291 states have call predecessors, (1881), 291 states have return successors, (1881), 1788 states have call predecessors, (1881), 1881 states have call successors, (1881) [2025-03-04 00:10:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14221 states to 14221 states and 21677 transitions. [2025-03-04 00:10:27,642 INFO L78 Accepts]: Start accepts. Automaton has 14221 states and 21677 transitions. Word has length 361 [2025-03-04 00:10:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:27,643 INFO L471 AbstractCegarLoop]: Abstraction has 14221 states and 21677 transitions. [2025-03-04 00:10:27,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 7.4375) internal successors, (238), 30 states have internal predecessors, (238), 12 states have call successors, (146), 5 states have call predecessors, (146), 11 states have return successors, (147), 12 states have call predecessors, (147), 12 states have call successors, (147) [2025-03-04 00:10:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14221 states and 21677 transitions. [2025-03-04 00:10:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-04 00:10:27,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:27,662 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:27,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:27,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:27,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:27,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:27,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1957088186, now seen corresponding path program 1 times [2025-03-04 00:10:27,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:27,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446568301] [2025-03-04 00:10:27,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:27,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-04 00:10:28,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-04 00:10:28,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:28,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 51 proven. 111 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2025-03-04 00:10:28,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446568301] [2025-03-04 00:10:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446568301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321993905] [2025-03-04 00:10:28,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:28,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:28,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:28,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:28,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:10:28,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-04 00:10:28,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-04 00:10:28,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:28,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:28,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:10:28,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2604 proven. 111 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2025-03-04 00:10:29,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 51 proven. 111 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2025-03-04 00:10:29,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321993905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:29,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2025-03-04 00:10:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817255322] [2025-03-04 00:10:29,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:29,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:10:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:29,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:10:29,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:10:29,658 INFO L87 Difference]: Start difference. First operand 14221 states and 21677 transitions. Second operand has 17 states, 16 states have (on average 11.125) internal successors, (178), 17 states have internal predecessors, (178), 7 states have call successors, (165), 3 states have call predecessors, (165), 6 states have return successors, (165), 7 states have call predecessors, (165), 7 states have call successors, (165) [2025-03-04 00:10:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:31,565 INFO L93 Difference]: Finished difference Result 36390 states and 55963 transitions. [2025-03-04 00:10:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 00:10:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.125) internal successors, (178), 17 states have internal predecessors, (178), 7 states have call successors, (165), 3 states have call predecessors, (165), 6 states have return successors, (165), 7 states have call predecessors, (165), 7 states have call successors, (165) Word has length 362 [2025-03-04 00:10:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:31,615 INFO L225 Difference]: With dead ends: 36390 [2025-03-04 00:10:31,616 INFO L226 Difference]: Without dead ends: 22269 [2025-03-04 00:10:31,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:10:31,633 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 771 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:31,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1673 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:10:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22269 states. [2025-03-04 00:10:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22269 to 14777. [2025-03-04 00:10:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14777 states, 12398 states have (on average 1.4870946926923698) internal successors, (18437), 12499 states have internal predecessors, (18437), 2055 states have call successors, (2055), 323 states have call predecessors, (2055), 323 states have return successors, (2055), 1954 states have call predecessors, (2055), 2055 states have call successors, (2055) [2025-03-04 00:10:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14777 states to 14777 states and 22547 transitions. [2025-03-04 00:10:32,573 INFO L78 Accepts]: Start accepts. Automaton has 14777 states and 22547 transitions. Word has length 362 [2025-03-04 00:10:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:32,574 INFO L471 AbstractCegarLoop]: Abstraction has 14777 states and 22547 transitions. [2025-03-04 00:10:32,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.125) internal successors, (178), 17 states have internal predecessors, (178), 7 states have call successors, (165), 3 states have call predecessors, (165), 6 states have return successors, (165), 7 states have call predecessors, (165), 7 states have call successors, (165) [2025-03-04 00:10:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14777 states and 22547 transitions. [2025-03-04 00:10:32,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-04 00:10:32,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:32,582 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:32,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:10:32,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:32,782 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:32,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1118025128, now seen corresponding path program 1 times [2025-03-04 00:10:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273922793] [2025-03-04 00:10:32,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:32,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-04 00:10:32,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-04 00:10:32,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:32,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-04 00:10:33,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:33,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273922793] [2025-03-04 00:10:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273922793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:33,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:33,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:33,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580795760] [2025-03-04 00:10:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:33,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:33,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:33,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:33,028 INFO L87 Difference]: Start difference. First operand 14777 states and 22547 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-04 00:10:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:34,699 INFO L93 Difference]: Finished difference Result 31579 states and 47972 transitions. [2025-03-04 00:10:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:34,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 363 [2025-03-04 00:10:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:34,769 INFO L225 Difference]: With dead ends: 31579 [2025-03-04 00:10:34,769 INFO L226 Difference]: Without dead ends: 23601 [2025-03-04 00:10:34,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:34,790 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 285 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:34,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 859 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23601 states. [2025-03-04 00:10:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23601 to 21173. [2025-03-04 00:10:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21173 states, 17754 states have (on average 1.4796102286808606) internal successors, (26269), 17895 states have internal predecessors, (26269), 2939 states have call successors, (2939), 479 states have call predecessors, (2939), 479 states have return successors, (2939), 2798 states have call predecessors, (2939), 2939 states have call successors, (2939) [2025-03-04 00:10:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21173 states to 21173 states and 32147 transitions. [2025-03-04 00:10:36,179 INFO L78 Accepts]: Start accepts. Automaton has 21173 states and 32147 transitions. Word has length 363 [2025-03-04 00:10:36,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:36,180 INFO L471 AbstractCegarLoop]: Abstraction has 21173 states and 32147 transitions. [2025-03-04 00:10:36,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-04 00:10:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 21173 states and 32147 transitions. [2025-03-04 00:10:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-04 00:10:36,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:36,186 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:36,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:10:36,186 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:36,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash 712967078, now seen corresponding path program 1 times [2025-03-04 00:10:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:36,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101523794] [2025-03-04 00:10:36,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:36,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-04 00:10:36,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-04 00:10:36,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:36,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 258 proven. 60 refuted. 0 times theorem prover too weak. 5622 trivial. 0 not checked. [2025-03-04 00:10:41,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101523794] [2025-03-04 00:10:41,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101523794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:41,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255072116] [2025-03-04 00:10:41,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:41,880 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:41,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:10:42,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-04 00:10:42,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-04 00:10:42,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:42,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:42,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 00:10:42,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 4219 proven. 201 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2025-03-04 00:10:51,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 153 proven. 9 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2025-03-04 00:10:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255072116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:52,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 9] total 36 [2025-03-04 00:10:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901857761] [2025-03-04 00:10:52,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:52,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 00:10:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:52,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 00:10:52,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1088, Unknown=3, NotChecked=0, Total=1260 [2025-03-04 00:10:52,964 INFO L87 Difference]: Start difference. First operand 21173 states and 32147 transitions. Second operand has 36 states, 36 states have (on average 7.138888888888889) internal successors, (257), 34 states have internal predecessors, (257), 10 states have call successors, (147), 6 states have call predecessors, (147), 10 states have return successors, (148), 10 states have call predecessors, (148), 10 states have call successors, (148) [2025-03-04 00:10:59,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:11:07,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:11:11,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:11:15,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []