./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-41.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-41.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 66faedc76e2888a747bab206dd9951b65d0513a976e7d390b67897d185d819f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:11:19,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:11:19,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:11:19,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:11:19,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:11:19,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:11:19,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:11:19,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:11:19,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:11:19,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:11:19,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:11:19,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:11:19,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:11:19,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:11:19,623 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:11:19,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:11:19,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:19,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:11:19,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:11:19,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:11:19,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:11:19,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:11:19,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:11:19,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:11:19,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:11:19,625 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 -> 66faedc76e2888a747bab206dd9951b65d0513a976e7d390b67897d185d819f3 [2025-03-04 00:11:19,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:11:19,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:11:19,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:11:19,862 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:11:19,862 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:11:19,864 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-41.i [2025-03-04 00:11:21,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e607abc6c/716bd318c622481bb534b8af0392707c/FLAG23c637197 [2025-03-04 00:11:21,370 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:11:21,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-41.i [2025-03-04 00:11:21,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e607abc6c/716bd318c622481bb534b8af0392707c/FLAG23c637197 [2025-03-04 00:11:21,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e607abc6c/716bd318c622481bb534b8af0392707c [2025-03-04 00:11:21,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:11:21,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:11:21,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:21,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:11:21,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:11:21,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:21,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21, skipping insertion in model container [2025-03-04 00:11:21,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:21,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:11:21,794 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-41.i[916,929] [2025-03-04 00:11:21,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:21,913 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:11:21,921 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-41.i[916,929] [2025-03-04 00:11:21,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:21,985 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:11:21,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21 WrapperNode [2025-03-04 00:11:21,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:21,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:21,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:11:21,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:11:21,991 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:11:21" (1/1) ... [2025-03-04 00:11:22,003 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:11:21" (1/1) ... [2025-03-04 00:11:22,053 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2025-03-04 00:11:22,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:22,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:11:22,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:11:22,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:11:22,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,104 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:11:22,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:11:22,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:11:22,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:11:22,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:11:22,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (1/1) ... [2025-03-04 00:11:22,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:22,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:22,181 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:11:22,183 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:11:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:11:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:11:22,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:11:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:11:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:11:22,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:11:22,271 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:11:22,272 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:11:22,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L342: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~ite38#1;havoc property_#t~bitwise37#1;havoc property_#t~short39#1;havoc property_#t~ite45#1;havoc property_#t~ite44#1;havoc property_#t~ite43#1;havoc property_#t~ite42#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~short46#1;havoc property_#t~ite48#1;havoc property_#t~bitwise47#1;havoc property_#t~short49#1; [2025-03-04 00:11:22,951 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-03-04 00:11:22,951 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:11:22,968 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:11:22,969 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-04 00:11:22,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:22 BoogieIcfgContainer [2025-03-04 00:11:22,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:11:22,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:11:22,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:11:22,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:11:22,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:11:21" (1/3) ... [2025-03-04 00:11:22,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4e949e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:22, skipping insertion in model container [2025-03-04 00:11:22,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:21" (2/3) ... [2025-03-04 00:11:22,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4e949e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:22, skipping insertion in model container [2025-03-04 00:11:22,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:22" (3/3) ... [2025-03-04 00:11:22,978 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-41.i [2025-03-04 00:11:22,988 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:11:22,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-41.i that has 2 procedures, 185 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:11:23,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:11:23,047 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;@47c87604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:11:23,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:11:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 185 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:11:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:11:23,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:23,071 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:23,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:23,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash -810849820, now seen corresponding path program 1 times [2025-03-04 00:11:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:23,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250746190] [2025-03-04 00:11:23,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:23,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:11:23,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:11:23,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:23,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-03-04 00:11:23,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250746190] [2025-03-04 00:11:23,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250746190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:23,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780097287] [2025-03-04 00:11:23,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:23,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:23,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:23,452 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:11:23,454 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:11:23,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:11:23,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:11:23,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:23,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:23,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:11:23,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-03-04 00:11:23,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:11:23,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780097287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:23,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:11:23,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:11:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537368740] [2025-03-04 00:11:23,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:23,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:11:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:23,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:11:23,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:11:23,755 INFO L87 Difference]: Start difference. First operand has 185 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:11:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:23,796 INFO L93 Difference]: Finished difference Result 364 states and 628 transitions. [2025-03-04 00:11:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:11:23,799 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) Word has length 302 [2025-03-04 00:11:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:23,806 INFO L225 Difference]: With dead ends: 364 [2025-03-04 00:11:23,806 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 00:11:23,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 303 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:11:23,813 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:23,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 00:11:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-04 00:11:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 135 states have (on average 1.4666666666666666) internal successors, (198), 135 states have internal predecessors, (198), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:11:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 288 transitions. [2025-03-04 00:11:23,868 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 288 transitions. Word has length 302 [2025-03-04 00:11:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:23,868 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 288 transitions. [2025-03-04 00:11:23,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:11:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 288 transitions. [2025-03-04 00:11:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 00:11:23,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:23,873 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:23,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:11:24,073 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:11:24,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:24,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash -680309057, now seen corresponding path program 1 times [2025-03-04 00:11:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:24,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072683447] [2025-03-04 00:11:24,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:24,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:24,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 00:11:24,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 00:11:24,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:24,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:11:24,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:24,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072683447] [2025-03-04 00:11:24,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072683447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:24,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:24,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:24,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102453131] [2025-03-04 00:11:24,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:24,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:24,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:24,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:24,353 INFO L87 Difference]: Start difference. First operand 182 states and 288 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:24,476 INFO L93 Difference]: Finished difference Result 468 states and 737 transitions. [2025-03-04 00:11:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:24,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 302 [2025-03-04 00:11:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:24,481 INFO L225 Difference]: With dead ends: 468 [2025-03-04 00:11:24,483 INFO L226 Difference]: Without dead ends: 289 [2025-03-04 00:11:24,484 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:11:24,486 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 169 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:24,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 513 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:11:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-04 00:11:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2025-03-04 00:11:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 218 states have (on average 1.4403669724770642) internal successors, (314), 219 states have internal predecessors, (314), 65 states have call successors, (65), 2 states have call predecessors, (65), 2 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:11:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 444 transitions. [2025-03-04 00:11:24,522 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 444 transitions. Word has length 302 [2025-03-04 00:11:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:24,524 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 444 transitions. [2025-03-04 00:11:24,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 444 transitions. [2025-03-04 00:11:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-04 00:11:24,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:24,529 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:11:24,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:24,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1398447514, now seen corresponding path program 1 times [2025-03-04 00:11:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:24,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090023402] [2025-03-04 00:11:24,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:24,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-04 00:11:24,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-04 00:11:24,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:24,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:11:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090023402] [2025-03-04 00:11:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090023402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:24,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:24,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777209285] [2025-03-04 00:11:24,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:24,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:24,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:24,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:24,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:24,854 INFO L87 Difference]: Start difference. First operand 286 states and 444 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:24,898 INFO L93 Difference]: Finished difference Result 570 states and 887 transitions. [2025-03-04 00:11:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:24,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 304 [2025-03-04 00:11:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:24,902 INFO L225 Difference]: With dead ends: 570 [2025-03-04 00:11:24,902 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 00:11:24,903 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:11:24,903 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:24,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 00:11:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-03-04 00:11:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 219 states have (on average 1.4383561643835616) internal successors, (315), 220 states have internal predecessors, (315), 65 states have call successors, (65), 2 states have call predecessors, (65), 2 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:11:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2025-03-04 00:11:24,928 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 304 [2025-03-04 00:11:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:24,929 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2025-03-04 00:11:24,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2025-03-04 00:11:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-04 00:11:24,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:24,932 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:24,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:11:24,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:24,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1195779303, now seen corresponding path program 1 times [2025-03-04 00:11:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:24,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051213157] [2025-03-04 00:11:24,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:24,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:24,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-04 00:11:24,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-04 00:11:24,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:24,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:11:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051213157] [2025-03-04 00:11:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051213157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:25,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793447323] [2025-03-04 00:11:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:25,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:25,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:25,227 INFO L87 Difference]: Start difference. First operand 287 states and 445 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:25,270 INFO L93 Difference]: Finished difference Result 571 states and 887 transitions. [2025-03-04 00:11:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:25,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 304 [2025-03-04 00:11:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:25,274 INFO L225 Difference]: With dead ends: 571 [2025-03-04 00:11:25,274 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 00:11:25,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:11:25,275 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:25,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 00:11:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-03-04 00:11:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 219 states have (on average 1.4337899543378996) internal successors, (314), 220 states have internal predecessors, (314), 65 states have call successors, (65), 2 states have call predecessors, (65), 2 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:11:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 444 transitions. [2025-03-04 00:11:25,295 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 444 transitions. Word has length 304 [2025-03-04 00:11:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:25,295 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 444 transitions. [2025-03-04 00:11:25,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 444 transitions. [2025-03-04 00:11:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:11:25,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:25,298 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:25,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:11:25,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1441685203, now seen corresponding path program 1 times [2025-03-04 00:11:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:25,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716926966] [2025-03-04 00:11:25,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:25,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:11:25,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:11:25,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:25,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:11:26,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716926966] [2025-03-04 00:11:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716926966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470094865] [2025-03-04 00:11:26,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:26,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:26,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:11:26,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:11:26,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:11:26,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:11:26,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:26,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:11:26,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:11:26,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:11:26,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470094865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:26,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:11:26,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-04 00:11:26,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236179133] [2025-03-04 00:11:26,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:26,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:11:26,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:26,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:11:26,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:11:26,552 INFO L87 Difference]: Start difference. First operand 287 states and 444 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:27,168 INFO L93 Difference]: Finished difference Result 1075 states and 1665 transitions. [2025-03-04 00:11:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:11:27,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-03-04 00:11:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:27,172 INFO L225 Difference]: With dead ends: 1075 [2025-03-04 00:11:27,173 INFO L226 Difference]: Without dead ends: 791 [2025-03-04 00:11:27,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:11:27,175 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 602 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:27,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 874 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:11:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-04 00:11:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 421. [2025-03-04 00:11:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 353 states have (on average 1.5042492917847026) internal successors, (531), 354 states have internal predecessors, (531), 65 states have call successors, (65), 2 states have call predecessors, (65), 2 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:11:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 661 transitions. [2025-03-04 00:11:27,216 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 661 transitions. Word has length 305 [2025-03-04 00:11:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:27,217 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 661 transitions. [2025-03-04 00:11:27,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 661 transitions. [2025-03-04 00:11:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:11:27,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:27,220 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:27,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:11:27,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:27,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:27,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1653036116, now seen corresponding path program 1 times [2025-03-04 00:11:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:27,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281793328] [2025-03-04 00:11:27,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:27,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:27,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:11:27,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:11:27,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:27,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:11:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281793328] [2025-03-04 00:11:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281793328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136504106] [2025-03-04 00:11:28,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:28,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:28,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:28,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:11:28,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:11:28,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:11:28,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:11:28,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:28,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:28,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:11:28,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2205 proven. 69 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2025-03-04 00:11:28,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:11:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136504106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:29,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 6] total 18 [2025-03-04 00:11:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309035245] [2025-03-04 00:11:29,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:29,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:11:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:29,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:11:29,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:11:29,061 INFO L87 Difference]: Start difference. First operand 421 states and 661 transitions. Second operand has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 17 states have internal predecessors, (121), 6 states have call successors, (67), 4 states have call predecessors, (67), 7 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2025-03-04 00:11:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:31,010 INFO L93 Difference]: Finished difference Result 1377 states and 2097 transitions. [2025-03-04 00:11:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 00:11:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 17 states have internal predecessors, (121), 6 states have call successors, (67), 4 states have call predecessors, (67), 7 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) Word has length 305 [2025-03-04 00:11:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:31,015 INFO L225 Difference]: With dead ends: 1377 [2025-03-04 00:11:31,015 INFO L226 Difference]: Without dead ends: 959 [2025-03-04 00:11:31,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=868, Invalid=2792, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 00:11:31,017 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 2060 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2088 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:31,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2088 Valid, 1314 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:11:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-04 00:11:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 439. [2025-03-04 00:11:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 367 states have (on average 1.4795640326975477) internal successors, (543), 368 states have internal predecessors, (543), 65 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:11:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 673 transitions. [2025-03-04 00:11:31,057 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 673 transitions. Word has length 305 [2025-03-04 00:11:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:31,059 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 673 transitions. [2025-03-04 00:11:31,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 17 states have internal predecessors, (121), 6 states have call successors, (67), 4 states have call predecessors, (67), 7 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2025-03-04 00:11:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 673 transitions. [2025-03-04 00:11:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-04 00:11:31,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:31,062 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:31,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:11:31,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:31,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash -174971031, now seen corresponding path program 1 times [2025-03-04 00:11:31,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:31,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936460281] [2025-03-04 00:11:31,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:31,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-04 00:11:31,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-04 00:11:31,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:31,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:11:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577799333] [2025-03-04 00:11:31,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:31,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:31,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:31,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:11:31,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:11:31,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-04 00:11:31,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-04 00:11:31,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:31,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:31,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:11:31,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:11:31,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:11:31,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:31,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936460281] [2025-03-04 00:11:31,872 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:11:31,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577799333] [2025-03-04 00:11:31,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577799333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:31,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:31,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:11:31,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162529302] [2025-03-04 00:11:31,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:31,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:11:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:31,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:11:31,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:11:31,873 INFO L87 Difference]: Start difference. First operand 439 states and 673 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:32,422 INFO L93 Difference]: Finished difference Result 1325 states and 1999 transitions. [2025-03-04 00:11:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:11:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 306 [2025-03-04 00:11:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:32,427 INFO L225 Difference]: With dead ends: 1325 [2025-03-04 00:11:32,427 INFO L226 Difference]: Without dead ends: 889 [2025-03-04 00:11:32,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:11:32,429 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 564 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:32,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 920 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:11:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-03-04 00:11:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 478. [2025-03-04 00:11:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 406 states have (on average 1.4876847290640394) internal successors, (604), 407 states have internal predecessors, (604), 65 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:11:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 734 transitions. [2025-03-04 00:11:32,466 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 734 transitions. Word has length 306 [2025-03-04 00:11:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:32,467 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 734 transitions. [2025-03-04 00:11:32,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:11:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 734 transitions. [2025-03-04 00:11:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-04 00:11:32,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:32,470 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:32,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:11:32,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:32,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:32,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash 36379882, now seen corresponding path program 1 times [2025-03-04 00:11:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280281867] [2025-03-04 00:11:32,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:32,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-04 00:11:32,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-04 00:11:32,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:32,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:11:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300623383] [2025-03-04 00:11:32,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:32,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:32,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:32,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:11:32,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:11:33,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-04 00:11:33,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-04 00:11:33,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:33,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:33,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 00:11:33,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2849 proven. 468 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2025-03-04 00:11:38,549 INFO L312 TraceCheckSpWp]: Computing backward predicates...