./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-39.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-39.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 4f3611a875fdf984da4dbe6a7960e00cbc86546d93a80a5be72248390d98dd3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:10:39,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:10:39,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:10:39,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:10:39,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:10:39,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:10:39,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:10:39,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:10:39,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:10:39,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:10:39,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:10:39,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:10:39,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:10:39,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:10:39,639 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:10:39,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:10:39,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:10:39,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:10:39,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:10:39,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:10:39,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:10:39,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:10:39,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:39,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:10:39,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:10:39,642 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:10:39,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:10:39,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:10:39,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:10:39,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:10:39,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:10:39,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:10:39,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:10:39,643 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 -> 4f3611a875fdf984da4dbe6a7960e00cbc86546d93a80a5be72248390d98dd3b [2025-03-04 00:10:39,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:10:39,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:10:39,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:10:39,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:10:39,908 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:10:39,909 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-39.i [2025-03-04 00:10:41,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a1f8356/192253ff4df242eeb9bd1343f472b94b/FLAGf871a0299 [2025-03-04 00:10:41,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:10:41,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-39.i [2025-03-04 00:10:41,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a1f8356/192253ff4df242eeb9bd1343f472b94b/FLAGf871a0299 [2025-03-04 00:10:41,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a1f8356/192253ff4df242eeb9bd1343f472b94b [2025-03-04 00:10:41,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:10:41,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:10:41,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:41,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:10:41,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:10:41,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573fd95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41, skipping insertion in model container [2025-03-04 00:10:41,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:10:41,537 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-39.i[916,929] [2025-03-04 00:10:41,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:41,692 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:10:41,699 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-39.i[916,929] [2025-03-04 00:10:41,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:41,779 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:10:41,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41 WrapperNode [2025-03-04 00:10:41,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:41,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:41,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:10:41,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:10:41,785 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:10:41" (1/1) ... [2025-03-04 00:10:41,801 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:10:41" (1/1) ... [2025-03-04 00:10:41,860 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 355 [2025-03-04 00:10:41,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:41,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:10:41,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:10:41,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:10:41,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,917 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:10:41,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:10:41,957 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:10:41,957 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:10:41,957 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:10:41,957 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (1/1) ... [2025-03-04 00:10:41,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:41,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:41,983 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:10:41,986 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:10:42,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:10:42,005 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:10:42,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:10:42,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:10:42,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:10:42,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:10:42,086 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:10:42,087 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:10:42,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: havoc property_#t~bitwise31#1; [2025-03-04 00:10:42,786 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-04 00:10:42,789 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:10:42,805 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:10:42,807 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:10:42,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:42 BoogieIcfgContainer [2025-03-04 00:10:42,809 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:10:42,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:10:42,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:10:42,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:10:42,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:10:41" (1/3) ... [2025-03-04 00:10:42,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262a6371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:42, skipping insertion in model container [2025-03-04 00:10:42,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:41" (2/3) ... [2025-03-04 00:10:42,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262a6371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:42, skipping insertion in model container [2025-03-04 00:10:42,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:42" (3/3) ... [2025-03-04 00:10:42,820 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-39.i [2025-03-04 00:10:42,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:10:42,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-39.i that has 2 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:10:42,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:10:42,900 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;@3a83b2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:10:42,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:10:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 00:10:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-04 00:10:42,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:42,918 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash 49916149, now seen corresponding path program 1 times [2025-03-04 00:10:42,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:42,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759838798] [2025-03-04 00:10:42,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:43,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:10:43,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:10:43,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:43,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-04 00:10:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:43,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759838798] [2025-03-04 00:10:43,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759838798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55536457] [2025-03-04 00:10:43,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:43,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:43,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:43,356 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:10:43,357 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:10:43,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:10:43,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:10:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:43,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:43,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:10:43,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-04 00:10:43,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:10:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55536457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:43,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:10:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198511525] [2025-03-04 00:10:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:43,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:10:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:43,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:10:43,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:10:43,677 INFO L87 Difference]: Start difference. First operand has 145 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-04 00:10:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:43,713 INFO L93 Difference]: Finished difference Result 284 states and 505 transitions. [2025-03-04 00:10:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:10:43,715 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 285 [2025-03-04 00:10:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:43,723 INFO L225 Difference]: With dead ends: 284 [2025-03-04 00:10:43,724 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 00:10:43,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 286 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:10:43,731 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:43,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 00:10:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-04 00:10:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 98 states have internal predecessors, (145), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 00:10:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 229 transitions. [2025-03-04 00:10:43,776 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 229 transitions. Word has length 285 [2025-03-04 00:10:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:43,776 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 229 transitions. [2025-03-04 00:10:43,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-04 00:10:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 229 transitions. [2025-03-04 00:10:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-04 00:10:43,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:43,781 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,789 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:10:43,981 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:10:43,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:43,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:43,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1813244441, now seen corresponding path program 1 times [2025-03-04 00:10:43,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:43,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045861709] [2025-03-04 00:10:43,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:44,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:10:44,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:10:44,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:44,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-04 00:10:44,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:44,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045861709] [2025-03-04 00:10:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045861709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:44,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:44,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846376663] [2025-03-04 00:10:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:44,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:44,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:44,334 INFO L87 Difference]: Start difference. First operand 142 states and 229 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-04 00:10:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:44,449 INFO L93 Difference]: Finished difference Result 384 states and 619 transitions. [2025-03-04 00:10:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 285 [2025-03-04 00:10:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:44,454 INFO L225 Difference]: With dead ends: 384 [2025-03-04 00:10:44,457 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 00:10:44,458 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:10:44,459 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 139 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:44,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 544 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:10:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 00:10:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2025-03-04 00:10:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 172 states have (on average 1.4709302325581395) internal successors, (253), 173 states have internal predecessors, (253), 67 states have call successors, (67), 2 states have call predecessors, (67), 2 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 00:10:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 387 transitions. [2025-03-04 00:10:44,494 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 387 transitions. Word has length 285 [2025-03-04 00:10:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:44,494 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 387 transitions. [2025-03-04 00:10:44,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-04 00:10:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 387 transitions. [2025-03-04 00:10:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:10:44,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:44,499 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:10:44,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:44,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:44,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2064346964, now seen corresponding path program 1 times [2025-03-04 00:10:44,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:44,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295745378] [2025-03-04 00:10:44,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:44,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:44,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:10:44,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:10:44,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:44,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-04 00:10:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:45,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295745378] [2025-03-04 00:10:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295745378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:45,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:45,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:45,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131820271] [2025-03-04 00:10:45,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:45,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:45,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:45,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:45,181 INFO L87 Difference]: Start difference. First operand 242 states and 387 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-04 00:10:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:45,271 INFO L93 Difference]: Finished difference Result 713 states and 1142 transitions. [2025-03-04 00:10:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:45,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 286 [2025-03-04 00:10:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:45,283 INFO L225 Difference]: With dead ends: 713 [2025-03-04 00:10:45,283 INFO L226 Difference]: Without dead ends: 474 [2025-03-04 00:10:45,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:45,286 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 110 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:45,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 435 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:10:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-04 00:10:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 444. [2025-03-04 00:10:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 305 states have (on average 1.4360655737704917) internal successors, (438), 307 states have internal predecessors, (438), 134 states have call successors, (134), 4 states have call predecessors, (134), 4 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-04 00:10:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 706 transitions. [2025-03-04 00:10:45,351 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 706 transitions. Word has length 286 [2025-03-04 00:10:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:45,352 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 706 transitions. [2025-03-04 00:10:45,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-04 00:10:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 706 transitions. [2025-03-04 00:10:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:10:45,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:45,361 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:10:45,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:45,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1770943957, now seen corresponding path program 1 times [2025-03-04 00:10:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726419251] [2025-03-04 00:10:45,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:45,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:10:45,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:10:45,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:45,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-04 00:10:45,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:45,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726419251] [2025-03-04 00:10:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726419251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:45,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:45,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:10:45,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764974301] [2025-03-04 00:10:45,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:45,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:10:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:45,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:10:45,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:45,886 INFO L87 Difference]: Start difference. First operand 444 states and 706 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-04 00:10:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:46,291 INFO L93 Difference]: Finished difference Result 1216 states and 1945 transitions. [2025-03-04 00:10:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:46,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 286 [2025-03-04 00:10:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:46,298 INFO L225 Difference]: With dead ends: 1216 [2025-03-04 00:10:46,299 INFO L226 Difference]: Without dead ends: 775 [2025-03-04 00:10:46,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:10:46,303 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 230 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:46,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 926 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-04 00:10:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 585. [2025-03-04 00:10:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 403 states have (on average 1.4218362282878412) internal successors, (573), 405 states have internal predecessors, (573), 176 states have call successors, (176), 5 states have call predecessors, (176), 5 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-04 00:10:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 925 transitions. [2025-03-04 00:10:46,398 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 925 transitions. Word has length 286 [2025-03-04 00:10:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:46,399 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 925 transitions. [2025-03-04 00:10:46,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-04 00:10:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 925 transitions. [2025-03-04 00:10:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:10:46,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:46,403 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:10:46,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2121743894, now seen corresponding path program 1 times [2025-03-04 00:10:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663448311] [2025-03-04 00:10:46,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:46,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:10:46,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:10:46,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:46,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-04 00:10:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:47,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663448311] [2025-03-04 00:10:47,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663448311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:47,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:47,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:10:47,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274813061] [2025-03-04 00:10:47,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:47,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:10:47,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:47,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:10:47,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:47,241 INFO L87 Difference]: Start difference. First operand 585 states and 925 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-04 00:10:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:47,663 INFO L93 Difference]: Finished difference Result 1300 states and 2074 transitions. [2025-03-04 00:10:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:10:47,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 286 [2025-03-04 00:10:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:47,670 INFO L225 Difference]: With dead ends: 1300 [2025-03-04 00:10:47,670 INFO L226 Difference]: Without dead ends: 859 [2025-03-04 00:10:47,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:10:47,672 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 382 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:47,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 779 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-04 00:10:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 599. [2025-03-04 00:10:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 417 states have (on average 1.4268585131894485) internal successors, (595), 419 states have internal predecessors, (595), 176 states have call successors, (176), 5 states have call predecessors, (176), 5 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-04 00:10:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 947 transitions. [2025-03-04 00:10:47,758 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 947 transitions. Word has length 286 [2025-03-04 00:10:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:47,759 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 947 transitions. [2025-03-04 00:10:47,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-04 00:10:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 947 transitions. [2025-03-04 00:10:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:10:47,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:47,763 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:10:47,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash -96014059, now seen corresponding path program 1 times [2025-03-04 00:10:47,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:47,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511398978] [2025-03-04 00:10:47,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:47,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:47,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:10:48,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:10:48,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:48,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-04 00:10:57,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:57,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511398978] [2025-03-04 00:10:57,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511398978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:57,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:57,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 00:10:57,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158698450] [2025-03-04 00:10:57,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:57,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:10:57,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:57,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:10:57,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:10:57,868 INFO L87 Difference]: Start difference. First operand 599 states and 947 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-04 00:11:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:02,286 INFO L93 Difference]: Finished difference Result 2027 states and 3255 transitions. [2025-03-04 00:11:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 00:11:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) Word has length 286 [2025-03-04 00:11:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:02,295 INFO L225 Difference]: With dead ends: 2027 [2025-03-04 00:11:02,295 INFO L226 Difference]: Without dead ends: 1578 [2025-03-04 00:11:02,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 00:11:02,298 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 3428 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:02,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 2251 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 00:11:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-04 00:11:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 655. [2025-03-04 00:11:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 472 states have (on average 1.4427966101694916) internal successors, (681), 474 states have internal predecessors, (681), 176 states have call successors, (176), 6 states have call predecessors, (176), 6 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-04 00:11:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1033 transitions. [2025-03-04 00:11:02,360 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1033 transitions. Word has length 286 [2025-03-04 00:11:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:02,360 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1033 transitions. [2025-03-04 00:11:02,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-04 00:11:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1033 transitions. [2025-03-04 00:11:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:11:02,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:02,365 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:02,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:11:02,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:02,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash 409544566, now seen corresponding path program 1 times [2025-03-04 00:11:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023244248] [2025-03-04 00:11:02,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:02,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:03,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:03,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:03,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-04 00:11:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023244248] [2025-03-04 00:11:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023244248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:15,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:15,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 00:11:15,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215198999] [2025-03-04 00:11:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:15,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:11:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:15,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:11:15,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:11:15,289 INFO L87 Difference]: Start difference. First operand 655 states and 1033 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-04 00:11:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:18,835 INFO L93 Difference]: Finished difference Result 1919 states and 3081 transitions. [2025-03-04 00:11:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:11:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) Word has length 286 [2025-03-04 00:11:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:18,844 INFO L225 Difference]: With dead ends: 1919 [2025-03-04 00:11:18,844 INFO L226 Difference]: Without dead ends: 1450 [2025-03-04 00:11:18,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:11:18,847 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1862 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:18,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 1775 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 00:11:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-04 00:11:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 627. [2025-03-04 00:11:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 444 states have (on average 1.427927927927928) internal successors, (634), 446 states have internal predecessors, (634), 176 states have call successors, (176), 6 states have call predecessors, (176), 6 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-04 00:11:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 986 transitions. [2025-03-04 00:11:18,894 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 986 transitions. Word has length 286 [2025-03-04 00:11:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:18,895 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 986 transitions. [2025-03-04 00:11:18,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-04 00:11:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 986 transitions. [2025-03-04 00:11:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:11:18,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:18,897 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:18,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:11:18,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:18,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2134070348, now seen corresponding path program 1 times [2025-03-04 00:11:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708301346] [2025-03-04 00:11:18,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:18,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:19,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:19,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:19,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 18 proven. 105 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-04 00:11:19,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:19,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708301346] [2025-03-04 00:11:19,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708301346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:19,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947780009] [2025-03-04 00:11:19,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:19,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:19,678 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:11:19,690 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:11:19,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:19,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:19,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:19,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:19,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 00:11:19,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1180 proven. 489 refuted. 0 times theorem prover too weak. 1775 trivial. 0 not checked. [2025-03-04 00:11:23,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947780009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:26,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:11:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24] total 26 [2025-03-04 00:11:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372784614] [2025-03-04 00:11:26,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 00:11:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:26,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 00:11:26,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:11:26,830 INFO L87 Difference]: Start difference. First operand 627 states and 986 transitions. Second operand has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2025-03-04 00:11:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:29,094 INFO L93 Difference]: Finished difference Result 1267 states and 1895 transitions. [2025-03-04 00:11:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 00:11:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) Word has length 286 [2025-03-04 00:11:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:29,100 INFO L225 Difference]: With dead ends: 1267 [2025-03-04 00:11:29,100 INFO L226 Difference]: Without dead ends: 770 [2025-03-04 00:11:29,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=437, Invalid=2425, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 00:11:29,102 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 521 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:29,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1412 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:11:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-04 00:11:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 727. [2025-03-04 00:11:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 513 states have (on average 1.3391812865497077) internal successors, (687), 515 states have internal predecessors, (687), 176 states have call successors, (176), 37 states have call predecessors, (176), 37 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-04 00:11:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1039 transitions. [2025-03-04 00:11:29,157 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1039 transitions. Word has length 286 [2025-03-04 00:11:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:29,158 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1039 transitions. [2025-03-04 00:11:29,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2025-03-04 00:11:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1039 transitions. [2025-03-04 00:11:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:11:29,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:29,160 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:29,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:11:29,360 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,SelfDestructingSolverStorable7 [2025-03-04 00:11:29,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:29,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2031674346, now seen corresponding path program 1 times [2025-03-04 00:11:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:29,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095936625] [2025-03-04 00:11:29,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:29,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:29,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:29,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:29,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:29,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-04 00:11:34,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:34,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095936625] [2025-03-04 00:11:34,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095936625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:34,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:34,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 00:11:34,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811556395] [2025-03-04 00:11:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:34,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:11:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:34,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:11:34,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:11:34,907 INFO L87 Difference]: Start difference. First operand 727 states and 1039 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-04 00:11:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:37,509 INFO L93 Difference]: Finished difference Result 2023 states and 3031 transitions. [2025-03-04 00:11:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:11:37,510 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) Word has length 286 [2025-03-04 00:11:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:37,517 INFO L225 Difference]: With dead ends: 2023 [2025-03-04 00:11:37,517 INFO L226 Difference]: Without dead ends: 1486 [2025-03-04 00:11:37,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:11:37,526 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1585 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:37,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1405 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:11:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-04 00:11:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 839. [2025-03-04 00:11:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 625 states have (on average 1.3728) internal successors, (858), 627 states have internal predecessors, (858), 176 states have call successors, (176), 37 states have call predecessors, (176), 37 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-04 00:11:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1210 transitions. [2025-03-04 00:11:37,596 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1210 transitions. Word has length 286 [2025-03-04 00:11:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:37,597 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1210 transitions. [2025-03-04 00:11:37,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-04 00:11:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1210 transitions. [2025-03-04 00:11:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:11:37,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:37,599 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:11:37,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:37,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:37,600 INFO L85 PathProgramCache]: Analyzing trace with hash 225236661, now seen corresponding path program 1 times [2025-03-04 00:11:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:37,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791006397] [2025-03-04 00:11:37,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:37,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:37,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:37,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:37,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 3 proven. 120 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-04 00:11:39,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:39,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791006397] [2025-03-04 00:11:39,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791006397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:39,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946494034] [2025-03-04 00:11:39,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:39,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:39,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:39,013 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:11:39,014 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:11:39,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:39,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:39,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:39,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:39,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:11:39,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 893 proven. 105 refuted. 0 times theorem prover too weak. 2446 trivial. 0 not checked. [2025-03-04 00:11:39,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 18 proven. 105 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-04 00:11:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946494034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:41,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2025-03-04 00:11:41,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344308801] [2025-03-04 00:11:41,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:41,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 00:11:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:41,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 00:11:41,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:11:41,411 INFO L87 Difference]: Start difference. First operand 839 states and 1210 transitions. Second operand has 20 states, 19 states have (on average 10.368421052631579) internal successors, (197), 19 states have internal predecessors, (197), 6 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 6 states have call successors, (126) [2025-03-04 00:11:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:44,123 INFO L93 Difference]: Finished difference Result 4186 states and 6075 transitions. [2025-03-04 00:11:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 00:11:44,123 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.368421052631579) internal successors, (197), 19 states have internal predecessors, (197), 6 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 6 states have call successors, (126) Word has length 286 [2025-03-04 00:11:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:44,141 INFO L225 Difference]: With dead ends: 4186 [2025-03-04 00:11:44,141 INFO L226 Difference]: Without dead ends: 3599 [2025-03-04 00:11:44,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=612, Invalid=2694, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 00:11:44,145 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 2225 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:44,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 2272 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:11:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2025-03-04 00:11:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3125. [2025-03-04 00:11:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2345 states have (on average 1.3859275053304905) internal successors, (3250), 2361 states have internal predecessors, (3250), 626 states have call successors, (626), 153 states have call predecessors, (626), 153 states have return successors, (626), 610 states have call predecessors, (626), 626 states have call successors, (626) [2025-03-04 00:11:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4502 transitions. [2025-03-04 00:11:44,348 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4502 transitions. Word has length 286 [2025-03-04 00:11:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:44,348 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4502 transitions. [2025-03-04 00:11:44,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.368421052631579) internal successors, (197), 19 states have internal predecessors, (197), 6 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 6 states have call successors, (126) [2025-03-04 00:11:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4502 transitions. [2025-03-04 00:11:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:11:44,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:44,351 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:11:44,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:44,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:44,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash -786909865, now seen corresponding path program 1 times [2025-03-04 00:11:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:44,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583384461] [2025-03-04 00:11:44,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:44,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:44,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:44,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:44,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 30 proven. 93 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-04 00:11:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583384461] [2025-03-04 00:11:45,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583384461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471110133] [2025-03-04 00:11:45,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:45,787 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:11:45,787 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:11:45,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:45,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:45,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:45,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:45,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:11:45,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1301 proven. 93 refuted. 0 times theorem prover too weak. 2050 trivial. 0 not checked. [2025-03-04 00:11:46,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 30 proven. 93 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-04 00:11:47,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471110133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:47,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:47,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 26 [2025-03-04 00:11:47,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124720247] [2025-03-04 00:11:47,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 00:11:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:47,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 00:11:47,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-03-04 00:11:47,413 INFO L87 Difference]: Start difference. First operand 3125 states and 4502 transitions. Second operand has 26 states, 25 states have (on average 8.64) internal successors, (216), 26 states have internal predecessors, (216), 7 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 7 states have call successors, (126) [2025-03-04 00:11:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:49,464 INFO L93 Difference]: Finished difference Result 9001 states and 12819 transitions. [2025-03-04 00:11:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 00:11:49,465 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 8.64) internal successors, (216), 26 states have internal predecessors, (216), 7 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 7 states have call successors, (126) Word has length 286 [2025-03-04 00:11:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:49,489 INFO L225 Difference]: With dead ends: 9001 [2025-03-04 00:11:49,489 INFO L226 Difference]: Without dead ends: 6295 [2025-03-04 00:11:49,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 00:11:49,497 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1630 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:49,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 2431 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:11:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6295 states. [2025-03-04 00:11:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6295 to 4367. [2025-03-04 00:11:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4367 states, 3339 states have (on average 1.3878406708595388) internal successors, (4634), 3371 states have internal predecessors, (4634), 786 states have call successors, (786), 241 states have call predecessors, (786), 241 states have return successors, (786), 754 states have call predecessors, (786), 786 states have call successors, (786) [2025-03-04 00:11:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 4367 states and 6206 transitions. [2025-03-04 00:11:49,869 INFO L78 Accepts]: Start accepts. Automaton has 4367 states and 6206 transitions. Word has length 286 [2025-03-04 00:11:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:49,869 INFO L471 AbstractCegarLoop]: Abstraction has 4367 states and 6206 transitions. [2025-03-04 00:11:49,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 8.64) internal successors, (216), 26 states have internal predecessors, (216), 7 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 7 states have call successors, (126) [2025-03-04 00:11:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 6206 transitions. [2025-03-04 00:11:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:11:49,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:49,873 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:49,883 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:11:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:50,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1470001142, now seen corresponding path program 1 times [2025-03-04 00:11:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281076368] [2025-03-04 00:11:50,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:50,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:50,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:50,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:50,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 126 proven. 522 refuted. 0 times theorem prover too weak. 2796 trivial. 0 not checked. [2025-03-04 00:11:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281076368] [2025-03-04 00:11:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281076368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432079182] [2025-03-04 00:11:53,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:53,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:53,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:53,224 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:11:53,225 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:11:53,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:53,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:53,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:53,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:53,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 00:11:53,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1718 proven. 519 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2025-03-04 00:11:55,652 INFO L312 TraceCheckSpWp]: Computing backward predicates...