./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-99.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-99.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 488e55d188f50c80d73146c130bc528a02bef0b3d213155fb7178728f7b142f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:17:50,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:17:50,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:17:50,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:17:50,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:17:50,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:17:50,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:17:50,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:17:50,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:17:50,607 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:17:50,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:17:50,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:17:50,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:17:50,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:17:50,608 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:17:50,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:17:50,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:17:50,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:17:50,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:17:50,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:17:50,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:17:50,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:17:50,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:17:50,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:17:50,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:17:50,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:17:50,611 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 -> 488e55d188f50c80d73146c130bc528a02bef0b3d213155fb7178728f7b142f2 [2025-03-04 00:17:50,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:17:50,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:17:50,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:17:50,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:17:50,870 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:17:50,871 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-99.i [2025-03-04 00:17:52,026 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d204439/c1e61019eef54ed7b23aedba191d9408/FLAG57e98745c [2025-03-04 00:17:52,324 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:17:52,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-99.i [2025-03-04 00:17:52,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d204439/c1e61019eef54ed7b23aedba191d9408/FLAG57e98745c [2025-03-04 00:17:52,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d204439/c1e61019eef54ed7b23aedba191d9408 [2025-03-04 00:17:52,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:17:52,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:17:52,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:17:52,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:17:52,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:17:52,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f39d194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52, skipping insertion in model container [2025-03-04 00:17:52,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:17:52,521 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-99.i[916,929] [2025-03-04 00:17:52,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:17:52,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:17:52,710 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-99.i[916,929] [2025-03-04 00:17:52,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:17:52,799 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:17:52,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52 WrapperNode [2025-03-04 00:17:52,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:17:52,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:17:52,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:17:52,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:17:52,806 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:17:52" (1/1) ... [2025-03-04 00:17:52,824 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:17:52" (1/1) ... [2025-03-04 00:17:52,883 INFO L138 Inliner]: procedures = 26, calls = 72, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2025-03-04 00:17:52,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:17:52,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:17:52,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:17:52,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:17:52,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,931 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:17:52,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:17:52,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:17:52,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:17:52,972 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:17:52,974 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (1/1) ... [2025-03-04 00:17:52,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:17:52,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:52,999 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:17:53,005 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:17:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:17:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:17:53,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:17:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:17:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:17:53,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:17:53,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:17:53,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:17:53,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc property_#t~ite42#1;havoc property_#t~bitwise41#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1; [2025-03-04 00:17:53,819 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-04 00:17:53,819 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:17:53,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:17:53,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:17:53,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:17:53 BoogieIcfgContainer [2025-03-04 00:17:53,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:17:53,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:17:53,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:17:53,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:17:53,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:17:52" (1/3) ... [2025-03-04 00:17:53,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b2d1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:17:53, skipping insertion in model container [2025-03-04 00:17:53,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:52" (2/3) ... [2025-03-04 00:17:53,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b2d1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:17:53, skipping insertion in model container [2025-03-04 00:17:53,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:17:53" (3/3) ... [2025-03-04 00:17:53,848 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-99.i [2025-03-04 00:17:53,859 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:17:53,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-99.i that has 2 procedures, 188 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:17:53,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:17:53,916 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;@72081ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:17:53,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:17:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:17:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-04 00:17:53,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:53,936 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:53,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:53,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:53,943 INFO L85 PathProgramCache]: Analyzing trace with hash 765754497, now seen corresponding path program 1 times [2025-03-04 00:17:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860912920] [2025-03-04 00:17:53,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:54,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-04 00:17:54,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 00:17:54,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:54,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2025-03-04 00:17:54,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860912920] [2025-03-04 00:17:54,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860912920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:17:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658782556] [2025-03-04 00:17:54,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:54,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:54,398 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:17:54,400 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:17:54,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-04 00:17:54,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 00:17:54,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:54,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:54,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:17:54,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:17:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2025-03-04 00:17:54,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:17:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658782556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:54,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:17:54,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:17:54,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811255747] [2025-03-04 00:17:54,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:54,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:17:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:54,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:17:54,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:17:54,699 INFO L87 Difference]: Start difference. First operand has 188 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:17:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:54,732 INFO L93 Difference]: Finished difference Result 370 states and 662 transitions. [2025-03-04 00:17:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:17:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) Word has length 378 [2025-03-04 00:17:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:54,740 INFO L225 Difference]: With dead ends: 370 [2025-03-04 00:17:54,740 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 00:17:54,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 379 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:17:54,748 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:54,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:17:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 00:17:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-04 00:17:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 124 states have internal predecessors, (180), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:17:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 298 transitions. [2025-03-04 00:17:54,803 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 298 transitions. Word has length 378 [2025-03-04 00:17:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:54,805 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 298 transitions. [2025-03-04 00:17:54,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:17:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 298 transitions. [2025-03-04 00:17:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-04 00:17:54,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:54,811 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:54,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:17:55,011 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:17:55,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:55,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1779150860, now seen corresponding path program 1 times [2025-03-04 00:17:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:55,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250939988] [2025-03-04 00:17:55,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:55,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-04 00:17:55,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 00:17:55,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:55,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:17:55,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:55,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250939988] [2025-03-04 00:17:55,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250939988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:55,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:55,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:17:55,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687728855] [2025-03-04 00:17:55,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:55,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:17:55,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:55,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:17:55,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:17:55,405 INFO L87 Difference]: Start difference. First operand 185 states and 298 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:17:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:55,567 INFO L93 Difference]: Finished difference Result 543 states and 877 transitions. [2025-03-04 00:17:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:17:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 378 [2025-03-04 00:17:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:55,573 INFO L225 Difference]: With dead ends: 543 [2025-03-04 00:17:55,573 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 00:17:55,574 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:17:55,577 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 270 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:55,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 727 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:17:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 00:17:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 233. [2025-03-04 00:17:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:17:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 377 transitions. [2025-03-04 00:17:55,615 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 377 transitions. Word has length 378 [2025-03-04 00:17:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:55,618 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 377 transitions. [2025-03-04 00:17:55,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:17:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 377 transitions. [2025-03-04 00:17:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-04 00:17:55,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:55,624 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:55,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:17:55,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:55,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1805017876, now seen corresponding path program 1 times [2025-03-04 00:17:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:55,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336222056] [2025-03-04 00:17:55,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:55,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 00:17:55,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 00:17:55,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:55,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:17:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336222056] [2025-03-04 00:17:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336222056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:56,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:17:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715029100] [2025-03-04 00:17:56,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:56,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:17:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:56,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:17:56,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:17:56,302 INFO L87 Difference]: Start difference. First operand 233 states and 377 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:17:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:56,384 INFO L93 Difference]: Finished difference Result 689 states and 1117 transitions. [2025-03-04 00:17:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:17:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 379 [2025-03-04 00:17:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:56,390 INFO L225 Difference]: With dead ends: 689 [2025-03-04 00:17:56,390 INFO L226 Difference]: Without dead ends: 459 [2025-03-04 00:17:56,391 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:17:56,392 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 166 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:56,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 625 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:17:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-04 00:17:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2025-03-04 00:17:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 334 states have (on average 1.4970059880239521) internal successors, (500), 334 states have internal predecessors, (500), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 00:17:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 736 transitions. [2025-03-04 00:17:56,456 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 736 transitions. Word has length 379 [2025-03-04 00:17:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 736 transitions. [2025-03-04 00:17:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:17:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 736 transitions. [2025-03-04 00:17:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-04 00:17:56,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:56,464 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:56,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:17:56,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:56,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash -686326622, now seen corresponding path program 1 times [2025-03-04 00:17:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115252041] [2025-03-04 00:17:56,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:56,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 00:17:56,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 00:17:56,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:56,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:17:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115252041] [2025-03-04 00:17:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115252041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:57,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:57,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:17:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430490026] [2025-03-04 00:17:57,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:57,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:17:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:57,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:17:57,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:17:57,761 INFO L87 Difference]: Start difference. First operand 455 states and 736 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:17:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:58,876 INFO L93 Difference]: Finished difference Result 1645 states and 2644 transitions. [2025-03-04 00:17:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:17:58,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 380 [2025-03-04 00:17:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:58,888 INFO L225 Difference]: With dead ends: 1645 [2025-03-04 00:17:58,888 INFO L226 Difference]: Without dead ends: 1193 [2025-03-04 00:17:58,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:17:58,890 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 539 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:58,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1363 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:17:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-04 00:17:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 805. [2025-03-04 00:17:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 666 states have (on average 1.5405405405405406) internal successors, (1026), 670 states have internal predecessors, (1026), 130 states have call successors, (130), 8 states have call predecessors, (130), 8 states have return successors, (130), 126 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 00:17:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1286 transitions. [2025-03-04 00:17:58,997 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1286 transitions. Word has length 380 [2025-03-04 00:17:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:58,998 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1286 transitions. [2025-03-04 00:17:58,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:17:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1286 transitions. [2025-03-04 00:17:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-04 00:17:59,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:59,004 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:59,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:17:59,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:59,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash 6775075, now seen corresponding path program 1 times [2025-03-04 00:17:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8879309] [2025-03-04 00:17:59,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:59,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 00:17:59,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 00:17:59,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:59,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:18:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8879309] [2025-03-04 00:18:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8879309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:18:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:18:03,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:18:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5861271] [2025-03-04 00:18:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:18:03,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:18:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:03,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:18:03,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:18:03,870 INFO L87 Difference]: Start difference. First operand 805 states and 1286 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:18:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:07,904 INFO L93 Difference]: Finished difference Result 4395 states and 6996 transitions. [2025-03-04 00:18:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:18:07,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 380 [2025-03-04 00:18:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:07,922 INFO L225 Difference]: With dead ends: 4395 [2025-03-04 00:18:07,922 INFO L226 Difference]: Without dead ends: 3593 [2025-03-04 00:18:07,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:18:07,925 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 1762 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:07,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 1915 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 00:18:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2025-03-04 00:18:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 2265. [2025-03-04 00:18:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1928 states have (on average 1.5394190871369295) internal successors, (2968), 1944 states have internal predecessors, (2968), 308 states have call successors, (308), 28 states have call predecessors, (308), 28 states have return successors, (308), 292 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-04 00:18:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3584 transitions. [2025-03-04 00:18:08,049 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3584 transitions. Word has length 380 [2025-03-04 00:18:08,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:08,049 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 3584 transitions. [2025-03-04 00:18:08,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:18:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3584 transitions. [2025-03-04 00:18:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-04 00:18:08,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:08,057 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:08,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:18:08,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash -322990686, now seen corresponding path program 1 times [2025-03-04 00:18:08,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:08,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414941344] [2025-03-04 00:18:08,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:08,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:08,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 00:18:08,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 00:18:08,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:08,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:08,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414941344] [2025-03-04 00:18:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414941344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:08,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735174675] [2025-03-04 00:18:08,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:08,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:08,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:08,706 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:18:08,707 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:18:08,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 00:18:08,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 00:18:08,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:08,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:08,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:18:08,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:18:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3174 proven. 60 refuted. 0 times theorem prover too weak. 3610 trivial. 0 not checked. [2025-03-04 00:18:09,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:18:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 114 proven. 60 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735174675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:18:09,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:18:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-04 00:18:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392785856] [2025-03-04 00:18:09,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:18:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:18:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:09,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:18:09,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:18:09,483 INFO L87 Difference]: Start difference. First operand 2265 states and 3584 transitions. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 4 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 4 states have call predecessors, (116), 4 states have call successors, (116) [2025-03-04 00:18:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:10,808 INFO L93 Difference]: Finished difference Result 5437 states and 8559 transitions. [2025-03-04 00:18:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 00:18:10,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 4 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 4 states have call predecessors, (116), 4 states have call successors, (116) Word has length 380 [2025-03-04 00:18:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:10,824 INFO L225 Difference]: With dead ends: 5437 [2025-03-04 00:18:10,825 INFO L226 Difference]: Without dead ends: 3175 [2025-03-04 00:18:10,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=439, Invalid=1283, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 00:18:10,830 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1110 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:10,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 931 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:18:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2025-03-04 00:18:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2461. [2025-03-04 00:18:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2068 states have (on average 1.5294970986460348) internal successors, (3163), 2081 states have internal predecessors, (3163), 359 states have call successors, (359), 33 states have call predecessors, (359), 33 states have return successors, (359), 346 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-04 00:18:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3881 transitions. [2025-03-04 00:18:11,029 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3881 transitions. Word has length 380 [2025-03-04 00:18:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:11,030 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3881 transitions. [2025-03-04 00:18:11,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 4 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 4 states have call predecessors, (116), 4 states have call successors, (116) [2025-03-04 00:18:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3881 transitions. [2025-03-04 00:18:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-04 00:18:11,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:11,036 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:11,044 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:18:11,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 00:18:11,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1002214137, now seen corresponding path program 1 times [2025-03-04 00:18:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919637841] [2025-03-04 00:18:11,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:11,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-04 00:18:11,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-04 00:18:11,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:11,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:18:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919637841] [2025-03-04 00:18:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919637841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:18:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:18:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:18:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905865063] [2025-03-04 00:18:14,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:18:14,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:18:14,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:14,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:18:14,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:18:14,287 INFO L87 Difference]: Start difference. First operand 2461 states and 3881 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:18:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:16,933 INFO L93 Difference]: Finished difference Result 5815 states and 9221 transitions. [2025-03-04 00:18:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:18:16,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 381 [2025-03-04 00:18:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:16,946 INFO L225 Difference]: With dead ends: 5815 [2025-03-04 00:18:16,947 INFO L226 Difference]: Without dead ends: 3472 [2025-03-04 00:18:16,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:18:16,952 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 907 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:16,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 2094 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 00:18:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2025-03-04 00:18:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 2823. [2025-03-04 00:18:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2430 states have (on average 1.5436213991769547) internal successors, (3751), 2443 states have internal predecessors, (3751), 359 states have call successors, (359), 33 states have call predecessors, (359), 33 states have return successors, (359), 346 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-04 00:18:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 4469 transitions. [2025-03-04 00:18:17,131 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 4469 transitions. Word has length 381 [2025-03-04 00:18:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:17,132 INFO L471 AbstractCegarLoop]: Abstraction has 2823 states and 4469 transitions. [2025-03-04 00:18:17,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:18:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 4469 transitions. [2025-03-04 00:18:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-04 00:18:17,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:17,136 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:17,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:18:17,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:17,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1659949160, now seen corresponding path program 1 times [2025-03-04 00:18:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534763171] [2025-03-04 00:18:17,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:17,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-04 00:18:17,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-04 00:18:17,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:17,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:17,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534763171] [2025-03-04 00:18:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534763171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718948588] [2025-03-04 00:18:17,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:17,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:17,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:17,785 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:18:17,788 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:18:17,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-04 00:18:17,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-04 00:18:17,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:17,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:17,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:18:17,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:18:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 4013 proven. 210 refuted. 0 times theorem prover too weak. 2621 trivial. 0 not checked. [2025-03-04 00:18:19,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:18:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 132 proven. 213 refuted. 0 times theorem prover too weak. 6499 trivial. 0 not checked. [2025-03-04 00:18:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718948588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:18:20,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:18:20,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 27 [2025-03-04 00:18:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008381094] [2025-03-04 00:18:20,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:18:20,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 00:18:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:20,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 00:18:20,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:18:20,461 INFO L87 Difference]: Start difference. First operand 2823 states and 4469 transitions. Second operand has 27 states, 27 states have (on average 9.0) internal successors, (243), 27 states have internal predecessors, (243), 8 states have call successors, (177), 4 states have call predecessors, (177), 9 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) [2025-03-04 00:18:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:25,233 INFO L93 Difference]: Finished difference Result 6422 states and 10035 transitions. [2025-03-04 00:18:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-04 00:18:25,234 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.0) internal successors, (243), 27 states have internal predecessors, (243), 8 states have call successors, (177), 4 states have call predecessors, (177), 9 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) Word has length 381 [2025-03-04 00:18:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:25,245 INFO L225 Difference]: With dead ends: 6422 [2025-03-04 00:18:25,245 INFO L226 Difference]: Without dead ends: 3717 [2025-03-04 00:18:25,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2464, Invalid=10418, Unknown=0, NotChecked=0, Total=12882 [2025-03-04 00:18:25,251 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 4410 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 3719 mSolverCounterSat, 2662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4412 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 6381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2662 IncrementalHoareTripleChecker+Valid, 3719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:25,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4412 Valid, 3385 Invalid, 6381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2662 Valid, 3719 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 00:18:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2025-03-04 00:18:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 2375. [2025-03-04 00:18:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 1897 states have (on average 1.4275171323141802) internal successors, (2708), 1911 states have internal predecessors, (2708), 428 states have call successors, (428), 49 states have call predecessors, (428), 49 states have return successors, (428), 414 states have call predecessors, (428), 428 states have call successors, (428) [2025-03-04 00:18:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3564 transitions. [2025-03-04 00:18:25,426 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3564 transitions. Word has length 381 [2025-03-04 00:18:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:25,427 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3564 transitions. [2025-03-04 00:18:25,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.0) internal successors, (243), 27 states have internal predecessors, (243), 8 states have call successors, (177), 4 states have call predecessors, (177), 9 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) [2025-03-04 00:18:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3564 transitions. [2025-03-04 00:18:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-04 00:18:25,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:25,430 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:25,439 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:18:25,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:25,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash 653880860, now seen corresponding path program 1 times [2025-03-04 00:18:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:25,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153370409] [2025-03-04 00:18:25,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:25,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-04 00:18:25,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-04 00:18:25,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:25,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:18:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153370409] [2025-03-04 00:18:25,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153370409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:18:25,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:18:25,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:18:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73834223] [2025-03-04 00:18:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:18:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:18:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:25,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:18:25,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:18:25,840 INFO L87 Difference]: Start difference. First operand 2375 states and 3564 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:18:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:26,072 INFO L93 Difference]: Finished difference Result 5327 states and 8008 transitions. [2025-03-04 00:18:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:18:26,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382 [2025-03-04 00:18:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:26,087 INFO L225 Difference]: With dead ends: 5327 [2025-03-04 00:18:26,087 INFO L226 Difference]: Without dead ends: 3327 [2025-03-04 00:18:26,092 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:18:26,094 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 158 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:26,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 647 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:18:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2025-03-04 00:18:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3325. [2025-03-04 00:18:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 2581 states have (on average 1.397907787679194) internal successors, (3608), 2601 states have internal predecessors, (3608), 672 states have call successors, (672), 71 states have call predecessors, (672), 71 states have return successors, (672), 652 states have call predecessors, (672), 672 states have call successors, (672) [2025-03-04 00:18:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4952 transitions. [2025-03-04 00:18:26,367 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4952 transitions. Word has length 382 [2025-03-04 00:18:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:26,368 INFO L471 AbstractCegarLoop]: Abstraction has 3325 states and 4952 transitions. [2025-03-04 00:18:26,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:18:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4952 transitions. [2025-03-04 00:18:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-04 00:18:26,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:26,373 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:26,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:18:26,373 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:26,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash -510544545, now seen corresponding path program 1 times [2025-03-04 00:18:26,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135254950] [2025-03-04 00:18:26,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:26,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 00:18:26,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 00:18:26,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:26,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:18:26,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135254950] [2025-03-04 00:18:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135254950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:18:26,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:18:26,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:18:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003065162] [2025-03-04 00:18:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:18:26,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:18:26,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:26,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:18:26,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:18:26,784 INFO L87 Difference]: Start difference. First operand 3325 states and 4952 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:18:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:27,395 INFO L93 Difference]: Finished difference Result 7984 states and 11913 transitions. [2025-03-04 00:18:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:18:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 383 [2025-03-04 00:18:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:27,443 INFO L225 Difference]: With dead ends: 7984 [2025-03-04 00:18:27,443 INFO L226 Difference]: Without dead ends: 6002 [2025-03-04 00:18:27,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:18:27,448 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 302 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:27,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 807 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:18:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2025-03-04 00:18:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 5816. [2025-03-04 00:18:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5816 states, 4771 states have (on average 1.4175225319639488) internal successors, (6763), 4815 states have internal predecessors, (6763), 936 states have call successors, (936), 108 states have call predecessors, (936), 108 states have return successors, (936), 892 states have call predecessors, (936), 936 states have call successors, (936) [2025-03-04 00:18:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5816 states to 5816 states and 8635 transitions. [2025-03-04 00:18:27,968 INFO L78 Accepts]: Start accepts. Automaton has 5816 states and 8635 transitions. Word has length 383 [2025-03-04 00:18:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:27,969 INFO L471 AbstractCegarLoop]: Abstraction has 5816 states and 8635 transitions. [2025-03-04 00:18:27,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:18:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5816 states and 8635 transitions. [2025-03-04 00:18:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-04 00:18:27,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:27,974 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:27,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:18:27,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:27,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1314614136, now seen corresponding path program 1 times [2025-03-04 00:18:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557192093] [2025-03-04 00:18:27,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:27,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-04 00:18:28,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-04 00:18:28,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:28,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 75 proven. 99 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:28,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557192093] [2025-03-04 00:18:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557192093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039464478] [2025-03-04 00:18:28,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:28,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:28,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:28,493 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:18:28,510 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:18:28,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-04 00:18:28,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-04 00:18:28,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:28,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:28,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:18:28,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:18:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3018 proven. 54 refuted. 0 times theorem prover too weak. 3772 trivial. 0 not checked. [2025-03-04 00:18:28,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:18:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 120 proven. 54 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:29,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039464478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:18:29,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:18:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-04 00:18:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678457748] [2025-03-04 00:18:29,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:18:29,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:18:29,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:29,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:18:29,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:18:29,235 INFO L87 Difference]: Start difference. First operand 5816 states and 8635 transitions. Second operand has 11 states, 11 states have (on average 18.454545454545453) internal successors, (203), 11 states have internal predecessors, (203), 4 states have call successors, (110), 2 states have call predecessors, (110), 4 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) [2025-03-04 00:18:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:30,571 INFO L93 Difference]: Finished difference Result 13245 states and 19465 transitions. [2025-03-04 00:18:30,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 00:18:30,573 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.454545454545453) internal successors, (203), 11 states have internal predecessors, (203), 4 states have call successors, (110), 2 states have call predecessors, (110), 4 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) Word has length 384 [2025-03-04 00:18:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:30,594 INFO L225 Difference]: With dead ends: 13245 [2025-03-04 00:18:30,595 INFO L226 Difference]: Without dead ends: 8079 [2025-03-04 00:18:30,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:18:30,604 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1130 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:30,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 682 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:18:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8079 states. [2025-03-04 00:18:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8079 to 6812. [2025-03-04 00:18:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6812 states, 5436 states have (on average 1.3774834437086092) internal successors, (7488), 5488 states have internal predecessors, (7488), 1224 states have call successors, (1224), 151 states have call predecessors, (1224), 151 states have return successors, (1224), 1172 states have call predecessors, (1224), 1224 states have call successors, (1224) [2025-03-04 00:18:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 9936 transitions. [2025-03-04 00:18:31,247 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 9936 transitions. Word has length 384 [2025-03-04 00:18:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 6812 states and 9936 transitions. [2025-03-04 00:18:31,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.454545454545453) internal successors, (203), 11 states have internal predecessors, (203), 4 states have call successors, (110), 2 states have call predecessors, (110), 4 states have return successors, (112), 4 states have call predecessors, (112), 4 states have call successors, (112) [2025-03-04 00:18:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 9936 transitions. [2025-03-04 00:18:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-04 00:18:31,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:31,253 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:31,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:18:31,454 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:18:31,454 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:31,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash 546204867, now seen corresponding path program 1 times [2025-03-04 00:18:31,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:31,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828245082] [2025-03-04 00:18:31,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:31,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:31,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-04 00:18:31,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-04 00:18:31,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:31,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:18:31,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:31,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828245082] [2025-03-04 00:18:31,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828245082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:18:31,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:18:31,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:18:31,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064651456] [2025-03-04 00:18:31,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:18:31,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:18:31,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:31,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:18:31,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:18:31,983 INFO L87 Difference]: Start difference. First operand 6812 states and 9936 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:18:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:32,867 INFO L93 Difference]: Finished difference Result 11278 states and 16487 transitions. [2025-03-04 00:18:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:18:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 385 [2025-03-04 00:18:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:32,884 INFO L225 Difference]: With dead ends: 11278 [2025-03-04 00:18:32,884 INFO L226 Difference]: Without dead ends: 7062 [2025-03-04 00:18:32,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:18:32,890 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 319 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:32,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 900 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:18:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2025-03-04 00:18:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 6812. [2025-03-04 00:18:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6812 states, 5436 states have (on average 1.3756438557763062) internal successors, (7478), 5488 states have internal predecessors, (7478), 1224 states have call successors, (1224), 151 states have call predecessors, (1224), 151 states have return successors, (1224), 1172 states have call predecessors, (1224), 1224 states have call successors, (1224) [2025-03-04 00:18:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 9926 transitions. [2025-03-04 00:18:33,356 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 9926 transitions. Word has length 385 [2025-03-04 00:18:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:33,357 INFO L471 AbstractCegarLoop]: Abstraction has 6812 states and 9926 transitions. [2025-03-04 00:18:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:18:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 9926 transitions. [2025-03-04 00:18:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-04 00:18:33,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:33,361 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:33,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:18:33,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:33,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash 849288373, now seen corresponding path program 1 times [2025-03-04 00:18:33,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967080215] [2025-03-04 00:18:33,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:33,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-04 00:18:33,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-04 00:18:33,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:33,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 114 proven. 60 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:33,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967080215] [2025-03-04 00:18:33,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967080215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95490836] [2025-03-04 00:18:33,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:33,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:33,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:33,903 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:18:33,904 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:18:34,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-04 00:18:34,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-04 00:18:34,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:34,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:34,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:18:34,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:18:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2928 proven. 51 refuted. 0 times theorem prover too weak. 3865 trivial. 0 not checked. [2025-03-04 00:18:34,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:18:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 123 proven. 51 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:34,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95490836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:18:34,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:18:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 6] total 17 [2025-03-04 00:18:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383814237] [2025-03-04 00:18:34,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:18:34,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:18:34,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:34,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:18:34,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:18:34,964 INFO L87 Difference]: Start difference. First operand 6812 states and 9926 transitions. Second operand has 17 states, 17 states have (on average 14.647058823529411) internal successors, (249), 17 states have internal predecessors, (249), 6 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 6 states have call predecessors, (177), 6 states have call successors, (177) [2025-03-04 00:18:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:41,363 INFO L93 Difference]: Finished difference Result 51754 states and 75203 transitions. [2025-03-04 00:18:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 00:18:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.647058823529411) internal successors, (249), 17 states have internal predecessors, (249), 6 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 6 states have call predecessors, (177), 6 states have call successors, (177) Word has length 386 [2025-03-04 00:18:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:41,486 INFO L225 Difference]: With dead ends: 51754 [2025-03-04 00:18:41,486 INFO L226 Difference]: Without dead ends: 45428 [2025-03-04 00:18:41,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1234, Invalid=4618, Unknown=0, NotChecked=0, Total=5852 [2025-03-04 00:18:41,511 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 5058 mSDsluCounter, 3173 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 1697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5195 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 4571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1697 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5195 Valid, 3471 Invalid, 4571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1697 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 00:18:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45428 states. [2025-03-04 00:18:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45428 to 30420. [2025-03-04 00:18:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30420 states, 24362 states have (on average 1.3696740825876366) internal successors, (33368), 24626 states have internal predecessors, (33368), 5369 states have call successors, (5369), 688 states have call predecessors, (5369), 688 states have return successors, (5369), 5105 states have call predecessors, (5369), 5369 states have call successors, (5369) [2025-03-04 00:18:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30420 states to 30420 states and 44106 transitions. [2025-03-04 00:18:44,174 INFO L78 Accepts]: Start accepts. Automaton has 30420 states and 44106 transitions. Word has length 386 [2025-03-04 00:18:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:44,175 INFO L471 AbstractCegarLoop]: Abstraction has 30420 states and 44106 transitions. [2025-03-04 00:18:44,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.647058823529411) internal successors, (249), 17 states have internal predecessors, (249), 6 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 6 states have call predecessors, (177), 6 states have call successors, (177) [2025-03-04 00:18:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 30420 states and 44106 transitions. [2025-03-04 00:18:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-04 00:18:44,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:44,188 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:44,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:18:44,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 00:18:44,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:44,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1163627383, now seen corresponding path program 1 times [2025-03-04 00:18:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574278864] [2025-03-04 00:18:44,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:44,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-04 00:18:44,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-04 00:18:44,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:44,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:45,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574278864] [2025-03-04 00:18:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574278864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206750943] [2025-03-04 00:18:45,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:45,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:45,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:45,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:18:45,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:18:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-04 00:18:45,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-04 00:18:45,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:45,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:45,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:18:45,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:18:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 568 proven. 330 refuted. 0 times theorem prover too weak. 5946 trivial. 0 not checked. [2025-03-04 00:18:47,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:18:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:18:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206750943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:18:47,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:18:47,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 17 [2025-03-04 00:18:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562066096] [2025-03-04 00:18:47,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:18:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:18:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:47,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:18:47,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:18:47,457 INFO L87 Difference]: Start difference. First operand 30420 states and 44106 transitions. Second operand has 17 states, 17 states have (on average 14.470588235294118) internal successors, (246), 17 states have internal predecessors, (246), 4 states have call successors, (171), 3 states have call predecessors, (171), 5 states have return successors, (172), 4 states have call predecessors, (172), 4 states have call successors, (172) [2025-03-04 00:18:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:53,415 INFO L93 Difference]: Finished difference Result 75385 states and 105267 transitions. [2025-03-04 00:18:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 00:18:53,416 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.470588235294118) internal successors, (246), 17 states have internal predecessors, (246), 4 states have call successors, (171), 3 states have call predecessors, (171), 5 states have return successors, (172), 4 states have call predecessors, (172), 4 states have call successors, (172) Word has length 386 [2025-03-04 00:18:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:53,521 INFO L225 Difference]: With dead ends: 75385 [2025-03-04 00:18:53,521 INFO L226 Difference]: Without dead ends: 46165 [2025-03-04 00:18:53,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 768 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 00:18:53,567 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 880 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:53,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2286 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:18:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46165 states. [2025-03-04 00:18:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46165 to 32676. [2025-03-04 00:18:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32676 states, 26533 states have (on average 1.36822070629028) internal successors, (36303), 26773 states have internal predecessors, (36303), 5177 states have call successors, (5177), 965 states have call predecessors, (5177), 965 states have return successors, (5177), 4937 states have call predecessors, (5177), 5177 states have call successors, (5177) [2025-03-04 00:18:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32676 states to 32676 states and 46657 transitions. [2025-03-04 00:18:57,328 INFO L78 Accepts]: Start accepts. Automaton has 32676 states and 46657 transitions. Word has length 386 [2025-03-04 00:18:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:57,329 INFO L471 AbstractCegarLoop]: Abstraction has 32676 states and 46657 transitions. [2025-03-04 00:18:57,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.470588235294118) internal successors, (246), 17 states have internal predecessors, (246), 4 states have call successors, (171), 3 states have call predecessors, (171), 5 states have return successors, (172), 4 states have call predecessors, (172), 4 states have call successors, (172) [2025-03-04 00:18:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 32676 states and 46657 transitions. [2025-03-04 00:18:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-04 00:18:57,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:57,341 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:57,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:18:57,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:57,542 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:57,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2105847914, now seen corresponding path program 1 times [2025-03-04 00:18:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:57,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075436628] [2025-03-04 00:18:57,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:57,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-04 00:18:57,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-04 00:18:57,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:57,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:18:57,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394957789] [2025-03-04 00:18:57,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:57,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:57,829 INFO L229 MonitoredProcess]: Starting monitored process 8 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:18:57,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:18:57,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-04 00:18:58,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-04 00:18:58,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:58,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:58,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 00:18:58,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:19:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2656 proven. 294 refuted. 0 times theorem prover too weak. 3894 trivial. 0 not checked. [2025-03-04 00:19:00,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:19:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:19:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075436628] [2025-03-04 00:19:01,830 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:19:01,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394957789] [2025-03-04 00:19:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394957789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:19:01,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:19:01,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 00:19:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272135901] [2025-03-04 00:19:01,830 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:19:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:19:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:19:01,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:19:01,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:19:01,831 INFO L87 Difference]: Start difference. First operand 32676 states and 46657 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 3 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-04 00:19:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:19:05,156 INFO L93 Difference]: Finished difference Result 73083 states and 104646 transitions. [2025-03-04 00:19:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:19:05,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 3 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 386 [2025-03-04 00:19:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:19:05,259 INFO L225 Difference]: With dead ends: 73083 [2025-03-04 00:19:05,259 INFO L226 Difference]: Without dead ends: 40570 [2025-03-04 00:19:05,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:19:05,312 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 353 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:19:05,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1488 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:19:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40570 states. [2025-03-04 00:19:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40570 to 32680. [2025-03-04 00:19:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32680 states, 26536 states have (on average 1.3681413928248418) internal successors, (36305), 26776 states have internal predecessors, (36305), 5177 states have call successors, (5177), 966 states have call predecessors, (5177), 966 states have return successors, (5177), 4937 states have call predecessors, (5177), 5177 states have call successors, (5177) [2025-03-04 00:19:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32680 states to 32680 states and 46659 transitions. [2025-03-04 00:19:08,187 INFO L78 Accepts]: Start accepts. Automaton has 32680 states and 46659 transitions. Word has length 386 [2025-03-04 00:19:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:19:08,188 INFO L471 AbstractCegarLoop]: Abstraction has 32680 states and 46659 transitions. [2025-03-04 00:19:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 3 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-04 00:19:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 32680 states and 46659 transitions. [2025-03-04 00:19:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-04 00:19:08,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:19:08,200 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:08,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 00:19:08,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:19:08,401 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:19:08,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:19:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1859360993, now seen corresponding path program 1 times [2025-03-04 00:19:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:19:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843538776] [2025-03-04 00:19:08,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:19:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:19:08,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-04 00:19:08,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-04 00:19:08,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:19:08,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:19:08,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063358835] [2025-03-04 00:19:08,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:19:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:19:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:19:08,642 INFO L229 MonitoredProcess]: Starting monitored process 9 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:19:08,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process