./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-96.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-96.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 569b7b70ffce685c43ef1e1873a16a7ab7979c99918cf4e931b631a44259c89c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:17:39,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:17:39,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:17:39,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:17:39,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:17:39,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:17:39,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:17:39,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:17:39,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:17:39,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:17:39,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:17:39,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:17:39,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:17:39,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:17:39,490 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:17:39,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:17:39,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:17:39,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:17:39,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:17:39,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:17:39,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:17:39,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:17:39,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:17:39,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:17:39,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:17:39,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:17:39,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:17:39,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:17:39,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:17:39,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:17:39,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:17:39,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:17:39,493 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 -> 569b7b70ffce685c43ef1e1873a16a7ab7979c99918cf4e931b631a44259c89c [2025-03-04 00:17:39,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:17:39,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:17:39,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:17:39,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:17:39,739 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:17:39,740 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-96.i [2025-03-04 00:17:40,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6407e497/9742990b7a2f4c0aa1c0e43c83630211/FLAGff0af065d [2025-03-04 00:17:41,100 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:17:41,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-96.i [2025-03-04 00:17:41,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6407e497/9742990b7a2f4c0aa1c0e43c83630211/FLAGff0af065d [2025-03-04 00:17:41,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6407e497/9742990b7a2f4c0aa1c0e43c83630211 [2025-03-04 00:17:41,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:17:41,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:17:41,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:17:41,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:17:41,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:17:41,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ecc5b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41, skipping insertion in model container [2025-03-04 00:17:41,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:17:41,262 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-96.i[916,929] [2025-03-04 00:17:41,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:17:41,406 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:17:41,417 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-96.i[916,929] [2025-03-04 00:17:41,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:17:41,509 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:17:41,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41 WrapperNode [2025-03-04 00:17:41,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:17:41,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:17:41,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:17:41,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:17:41,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,604 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-03-04 00:17:41,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:17:41,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:17:41,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:17:41,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:17:41,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,661 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:17:41,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:17:41,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:17:41,693 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:17:41,693 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:17:41,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (1/1) ... [2025-03-04 00:17:41,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:17:41,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:41,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:17:41,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:17:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:17:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:17:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:17:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:17:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:17:41,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:17:41,856 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:17:41,858 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:17:42,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L342: havoc property_#t~bitwise33#1;havoc property_#t~bitwise34#1;havoc property_#t~short35#1;havoc property_#t~ite38#1;havoc property_#t~ite37#1;havoc property_#t~bitwise36#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1; [2025-03-04 00:17:42,550 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-03-04 00:17:42,550 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:17:42,570 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:17:42,570 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:17:42,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:17:42 BoogieIcfgContainer [2025-03-04 00:17:42,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:17:42,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:17:42,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:17:42,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:17:42,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:17:41" (1/3) ... [2025-03-04 00:17:42,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78692e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:17:42, skipping insertion in model container [2025-03-04 00:17:42,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:17:41" (2/3) ... [2025-03-04 00:17:42,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78692e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:17:42, skipping insertion in model container [2025-03-04 00:17:42,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:17:42" (3/3) ... [2025-03-04 00:17:42,579 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-96.i [2025-03-04 00:17:42,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:17:42,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-96.i that has 2 procedures, 178 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:17:42,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:17:42,648 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;@3bcdc6a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:17:42,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:17:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 137 states have (on average 1.510948905109489) internal successors, (207), 138 states have internal predecessors, (207), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:17:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-04 00:17:42,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:42,666 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:42,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:42,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2049687563, now seen corresponding path program 1 times [2025-03-04 00:17:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265322802] [2025-03-04 00:17:42,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:42,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-04 00:17:42,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-04 00:17:42,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:42,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-04 00:17:43,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265322802] [2025-03-04 00:17:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265322802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:17:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365217635] [2025-03-04 00:17:43,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:43,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:43,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:17:43,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:17:43,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-04 00:17:43,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-04 00:17:43,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:43,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:43,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:17:43,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:17:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-04 00:17:43,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:17:43,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365217635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:43,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:17:43,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:17:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697811912] [2025-03-04 00:17:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:17:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:43,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:17:43,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:17:43,299 INFO L87 Difference]: Start difference. First operand has 178 states, 137 states have (on average 1.510948905109489) internal successors, (207), 138 states have internal predecessors, (207), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:17:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:43,341 INFO L93 Difference]: Finished difference Result 350 states and 599 transitions. [2025-03-04 00:17:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:17:43,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 273 [2025-03-04 00:17:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:43,348 INFO L225 Difference]: With dead ends: 350 [2025-03-04 00:17:43,348 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 00:17:43,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:17:43,354 INFO L435 NwaCegarLoop]: 268 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, 268 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:17:43,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:17:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 00:17:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-04 00:17:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:17:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 276 transitions. [2025-03-04 00:17:43,401 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 276 transitions. Word has length 273 [2025-03-04 00:17:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:43,402 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 276 transitions. [2025-03-04 00:17:43,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:17:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 276 transitions. [2025-03-04 00:17:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-04 00:17:43,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:43,406 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:43,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:17:43,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:17:43,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:43,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 263561625, now seen corresponding path program 1 times [2025-03-04 00:17:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:43,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64435659] [2025-03-04 00:17:43,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:43,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-04 00:17:43,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-04 00:17:43,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:43,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:44,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64435659] [2025-03-04 00:17:44,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64435659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:44,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:44,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:17:44,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225727726] [2025-03-04 00:17:44,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:44,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:17:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:44,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:17:44,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:17:44,238 INFO L87 Difference]: Start difference. First operand 175 states and 276 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:44,377 INFO L93 Difference]: Finished difference Result 519 states and 822 transitions. [2025-03-04 00:17:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:17:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 273 [2025-03-04 00:17:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:44,382 INFO L225 Difference]: With dead ends: 519 [2025-03-04 00:17:44,385 INFO L226 Difference]: Without dead ends: 347 [2025-03-04 00:17:44,386 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:17:44,388 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 262 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:44,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 491 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:17:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-04 00:17:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2025-03-04 00:17:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 266 states have (on average 1.481203007518797) internal successors, (394), 266 states have internal predecessors, (394), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:17:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 546 transitions. [2025-03-04 00:17:44,441 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 546 transitions. Word has length 273 [2025-03-04 00:17:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:44,443 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 546 transitions. [2025-03-04 00:17:44,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 546 transitions. [2025-03-04 00:17:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-04 00:17:44,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:44,449 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:44,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:17:44,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:44,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:44,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1022725487, now seen corresponding path program 1 times [2025-03-04 00:17:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:44,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157865726] [2025-03-04 00:17:44,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:44,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-04 00:17:44,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-04 00:17:44,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:44,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:45,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157865726] [2025-03-04 00:17:45,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157865726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:45,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:17:45,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487408456] [2025-03-04 00:17:45,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:45,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:17:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:45,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:17:45,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:17:45,014 INFO L87 Difference]: Start difference. First operand 345 states and 546 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:45,213 INFO L93 Difference]: Finished difference Result 937 states and 1482 transitions. [2025-03-04 00:17:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:17:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 274 [2025-03-04 00:17:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:45,220 INFO L225 Difference]: With dead ends: 937 [2025-03-04 00:17:45,220 INFO L226 Difference]: Without dead ends: 595 [2025-03-04 00:17:45,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:17:45,221 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 194 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:45,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 792 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:17:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-04 00:17:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2025-03-04 00:17:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 482 states have (on average 1.5062240663900415) internal successors, (726), 484 states have internal predecessors, (726), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:17:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 934 transitions. [2025-03-04 00:17:45,269 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 934 transitions. Word has length 274 [2025-03-04 00:17:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:45,270 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 934 transitions. [2025-03-04 00:17:45,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 934 transitions. [2025-03-04 00:17:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-04 00:17:45,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:45,274 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:45,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:17:45,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:45,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1301302352, now seen corresponding path program 1 times [2025-03-04 00:17:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:45,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503356621] [2025-03-04 00:17:45,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:45,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-04 00:17:45,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-04 00:17:45,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:45,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:45,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503356621] [2025-03-04 00:17:45,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503356621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:45,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:45,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:17:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115633974] [2025-03-04 00:17:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:45,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:17:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:45,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:17:45,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:17:45,657 INFO L87 Difference]: Start difference. First operand 591 states and 934 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:45,736 INFO L93 Difference]: Finished difference Result 1266 states and 2001 transitions. [2025-03-04 00:17:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:17:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 274 [2025-03-04 00:17:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:45,744 INFO L225 Difference]: With dead ends: 1266 [2025-03-04 00:17:45,746 INFO L226 Difference]: Without dead ends: 678 [2025-03-04 00:17:45,748 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:17:45,749 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 240 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:45,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 499 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:17:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-03-04 00:17:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 591. [2025-03-04 00:17:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 482 states have (on average 1.4896265560165975) internal successors, (718), 484 states have internal predecessors, (718), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:17:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 926 transitions. [2025-03-04 00:17:45,800 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 926 transitions. Word has length 274 [2025-03-04 00:17:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:45,801 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 926 transitions. [2025-03-04 00:17:45,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 926 transitions. [2025-03-04 00:17:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 00:17:45,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:45,805 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:45,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:17:45,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:45,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:45,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1768934926, now seen corresponding path program 1 times [2025-03-04 00:17:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:45,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473812882] [2025-03-04 00:17:45,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:45,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 00:17:45,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 00:17:45,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:45,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473812882] [2025-03-04 00:17:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473812882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:46,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:46,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:17:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555392697] [2025-03-04 00:17:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:46,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:17:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:46,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:17:46,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:17:46,461 INFO L87 Difference]: Start difference. First operand 591 states and 926 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:47,054 INFO L93 Difference]: Finished difference Result 1665 states and 2592 transitions. [2025-03-04 00:17:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:17:47,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 275 [2025-03-04 00:17:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:47,062 INFO L225 Difference]: With dead ends: 1665 [2025-03-04 00:17:47,062 INFO L226 Difference]: Without dead ends: 1077 [2025-03-04 00:17:47,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:17:47,064 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 434 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:47,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 857 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:17:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-04 00:17:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 839. [2025-03-04 00:17:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 728 states have (on average 1.4917582417582418) internal successors, (1086), 730 states have internal predecessors, (1086), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:17:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1294 transitions. [2025-03-04 00:17:47,143 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1294 transitions. Word has length 275 [2025-03-04 00:17:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:47,144 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1294 transitions. [2025-03-04 00:17:47,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1294 transitions. [2025-03-04 00:17:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 00:17:47,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:47,149 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:47,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:17:47,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:47,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash 568351628, now seen corresponding path program 1 times [2025-03-04 00:17:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:47,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73594475] [2025-03-04 00:17:47,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:47,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 00:17:47,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 00:17:47,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:47,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 108 proven. 3 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:17:47,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:47,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73594475] [2025-03-04 00:17:47,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73594475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:17:47,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281730458] [2025-03-04 00:17:47,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:47,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:47,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:47,930 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:17:47,932 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:17:48,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 00:17:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 00:17:48,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:48,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:48,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:17:48,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:17:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:48,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:17:48,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281730458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:48,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:17:48,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-04 00:17:48,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880531235] [2025-03-04 00:17:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:48,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:17:48,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:48,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:17:48,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:17:48,320 INFO L87 Difference]: Start difference. First operand 839 states and 1294 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:48,694 INFO L93 Difference]: Finished difference Result 2431 states and 3752 transitions. [2025-03-04 00:17:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:17:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 275 [2025-03-04 00:17:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:48,701 INFO L225 Difference]: With dead ends: 2431 [2025-03-04 00:17:48,701 INFO L226 Difference]: Without dead ends: 1595 [2025-03-04 00:17:48,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:17:48,703 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 234 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:48,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 699 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:17:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2025-03-04 00:17:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1275. [2025-03-04 00:17:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1164 states have (on average 1.5171821305841924) internal successors, (1766), 1166 states have internal predecessors, (1766), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:17:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1974 transitions. [2025-03-04 00:17:48,771 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1974 transitions. Word has length 275 [2025-03-04 00:17:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:48,772 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1974 transitions. [2025-03-04 00:17:48,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1974 transitions. [2025-03-04 00:17:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-04 00:17:48,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:48,775 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:48,785 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:17:48,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 00:17:48,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:48,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash 372971215, now seen corresponding path program 1 times [2025-03-04 00:17:48,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:48,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140161189] [2025-03-04 00:17:48,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:48,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 00:17:49,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 00:17:49,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:49,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 108 proven. 3 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:17:49,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:49,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140161189] [2025-03-04 00:17:49,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140161189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:17:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523106654] [2025-03-04 00:17:49,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:49,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:49,719 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:17:49,720 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:17:49,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 00:17:49,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 00:17:49,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:49,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:49,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:17:49,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:17:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:50,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:17:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523106654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:50,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:17:50,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-04 00:17:50,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021923765] [2025-03-04 00:17:50,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:50,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:17:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:50,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:17:50,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:17:50,063 INFO L87 Difference]: Start difference. First operand 1275 states and 1974 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:50,384 INFO L93 Difference]: Finished difference Result 2875 states and 4436 transitions. [2025-03-04 00:17:50,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:17:50,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 276 [2025-03-04 00:17:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:50,392 INFO L225 Difference]: With dead ends: 2875 [2025-03-04 00:17:50,392 INFO L226 Difference]: Without dead ends: 1603 [2025-03-04 00:17:50,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:17:50,395 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 228 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:50,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 703 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:17:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-04 00:17:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1283. [2025-03-04 00:17:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1172 states have (on average 1.5204778156996588) internal successors, (1782), 1174 states have internal predecessors, (1782), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:17:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1990 transitions. [2025-03-04 00:17:50,457 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1990 transitions. Word has length 276 [2025-03-04 00:17:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:50,458 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1990 transitions. [2025-03-04 00:17:50,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1990 transitions. [2025-03-04 00:17:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-04 00:17:50,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:50,461 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:50,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:17:50,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:50,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:50,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2046720714, now seen corresponding path program 1 times [2025-03-04 00:17:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:50,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839236495] [2025-03-04 00:17:50,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:50,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 00:17:50,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 00:17:50,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:50,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 108 proven. 3 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:17:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839236495] [2025-03-04 00:17:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839236495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:17:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883570108] [2025-03-04 00:17:51,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:51,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:51,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:51,123 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:17:51,125 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:17:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 00:17:51,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 00:17:51,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:51,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:51,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:17:51,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:17:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-04 00:17:51,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:17:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883570108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:51,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:17:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-03-04 00:17:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88778280] [2025-03-04 00:17:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:51,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:17:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:51,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:17:51,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:17:51,410 INFO L87 Difference]: Start difference. First operand 1283 states and 1990 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:17:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:52,004 INFO L93 Difference]: Finished difference Result 2222 states and 3409 transitions. [2025-03-04 00:17:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:17:52,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) Word has length 276 [2025-03-04 00:17:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:52,011 INFO L225 Difference]: With dead ends: 2222 [2025-03-04 00:17:52,011 INFO L226 Difference]: Without dead ends: 942 [2025-03-04 00:17:52,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:17:52,014 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 366 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:52,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 927 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:17:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-04 00:17:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 839. [2025-03-04 00:17:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 726 states have (on average 1.4545454545454546) internal successors, (1056), 728 states have internal predecessors, (1056), 104 states have call successors, (104), 8 states have call predecessors, (104), 8 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:17:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1264 transitions. [2025-03-04 00:17:52,074 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1264 transitions. Word has length 276 [2025-03-04 00:17:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:52,076 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1264 transitions. [2025-03-04 00:17:52,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:17:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1264 transitions. [2025-03-04 00:17:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-04 00:17:52,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:52,079 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:52,086 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:17:52,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:52,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:52,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:52,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1666721273, now seen corresponding path program 1 times [2025-03-04 00:17:52,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:52,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900099715] [2025-03-04 00:17:52,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:52,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:52,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 00:17:52,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 00:17:52,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:52,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:17:52,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:52,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900099715] [2025-03-04 00:17:52,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900099715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:17:52,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327797388] [2025-03-04 00:17:52,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:52,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:52,786 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:17:52,787 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:17:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 00:17:53,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 00:17:53,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:53,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:53,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:17:53,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:17:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1166 proven. 156 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2025-03-04 00:17:53,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:17:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:17:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327797388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:17:53,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:17:53,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2025-03-04 00:17:53,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849759997] [2025-03-04 00:17:53,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:17:53,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:17:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:53,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:17:53,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:17:53,875 INFO L87 Difference]: Start difference. First operand 839 states and 1264 transitions. Second operand has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 4 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) [2025-03-04 00:17:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:54,704 INFO L93 Difference]: Finished difference Result 1820 states and 2707 transitions. [2025-03-04 00:17:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:17:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 4 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) Word has length 277 [2025-03-04 00:17:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:54,709 INFO L225 Difference]: With dead ends: 1820 [2025-03-04 00:17:54,709 INFO L226 Difference]: Without dead ends: 984 [2025-03-04 00:17:54,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2025-03-04 00:17:54,711 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 562 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:54,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1244 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:17:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-03-04 00:17:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 871. [2025-03-04 00:17:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 750 states have (on average 1.4346666666666668) internal successors, (1076), 752 states have internal predecessors, (1076), 104 states have call successors, (104), 16 states have call predecessors, (104), 16 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:17:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1284 transitions. [2025-03-04 00:17:54,778 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1284 transitions. Word has length 277 [2025-03-04 00:17:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:54,778 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1284 transitions. [2025-03-04 00:17:54,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 4 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) [2025-03-04 00:17:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1284 transitions. [2025-03-04 00:17:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-04 00:17:54,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:54,781 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:54,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:17:54,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:54,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2144368494, now seen corresponding path program 1 times [2025-03-04 00:17:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559079834] [2025-03-04 00:17:54,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:55,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 00:17:55,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 00:17:55,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:55,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:55,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559079834] [2025-03-04 00:17:55,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559079834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:55,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:55,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:17:55,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859194948] [2025-03-04 00:17:55,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:55,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:17:55,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:55,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:17:55,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:17:55,528 INFO L87 Difference]: Start difference. First operand 871 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:55,865 INFO L93 Difference]: Finished difference Result 2609 states and 3848 transitions. [2025-03-04 00:17:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:17:55,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 278 [2025-03-04 00:17:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:55,873 INFO L225 Difference]: With dead ends: 2609 [2025-03-04 00:17:55,874 INFO L226 Difference]: Without dead ends: 1741 [2025-03-04 00:17:55,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:17:55,876 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 357 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:55,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1018 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:17:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2025-03-04 00:17:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1737. [2025-03-04 00:17:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1496 states have (on average 1.4331550802139037) internal successors, (2144), 1500 states have internal predecessors, (2144), 208 states have call successors, (208), 32 states have call predecessors, (208), 32 states have return successors, (208), 204 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-04 00:17:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2560 transitions. [2025-03-04 00:17:55,982 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2560 transitions. Word has length 278 [2025-03-04 00:17:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:55,983 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2560 transitions. [2025-03-04 00:17:55,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2560 transitions. [2025-03-04 00:17:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-04 00:17:55,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:55,986 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:55,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:17:55,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:55,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash 449858323, now seen corresponding path program 1 times [2025-03-04 00:17:55,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:55,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107042276] [2025-03-04 00:17:55,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:56,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 00:17:56,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 00:17:56,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:56,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:56,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107042276] [2025-03-04 00:17:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107042276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:56,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:17:56,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:17:56,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804301663] [2025-03-04 00:17:56,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:56,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:17:56,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:56,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:17:56,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:17:56,939 INFO L87 Difference]: Start difference. First operand 1737 states and 2560 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:17:57,950 INFO L93 Difference]: Finished difference Result 5963 states and 8671 transitions. [2025-03-04 00:17:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:17:57,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 278 [2025-03-04 00:17:57,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:17:57,967 INFO L225 Difference]: With dead ends: 5963 [2025-03-04 00:17:57,967 INFO L226 Difference]: Without dead ends: 4229 [2025-03-04 00:17:57,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:17:57,972 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 743 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:17:57,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 876 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:17:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4229 states. [2025-03-04 00:17:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4229 to 2553. [2025-03-04 00:17:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2304 states have (on average 1.4652777777777777) internal successors, (3376), 2308 states have internal predecessors, (3376), 208 states have call successors, (208), 40 states have call predecessors, (208), 40 states have return successors, (208), 204 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-04 00:17:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3792 transitions. [2025-03-04 00:17:58,185 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3792 transitions. Word has length 278 [2025-03-04 00:17:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:17:58,186 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 3792 transitions. [2025-03-04 00:17:58,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:17:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3792 transitions. [2025-03-04 00:17:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-04 00:17:58,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:17:58,191 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:17:58,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:17:58,191 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:17:58,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:17:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1142960020, now seen corresponding path program 1 times [2025-03-04 00:17:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:17:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518336477] [2025-03-04 00:17:58,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:17:58,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 00:17:58,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 00:17:58,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:58,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 96 proven. 15 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:17:58,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:17:58,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518336477] [2025-03-04 00:17:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518336477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:17:58,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086498796] [2025-03-04 00:17:58,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:17:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:17:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:17:58,770 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:17:58,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:17:58,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 00:17:58,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 00:17:58,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:17:58,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:17:58,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:17:58,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:17:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:17:59,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:17:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086498796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:17:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:17:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-04 00:17:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75218444] [2025-03-04 00:17:59,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:17:59,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:17:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:17:59,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:17:59,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:17:59,135 INFO L87 Difference]: Start difference. First operand 2553 states and 3792 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:18:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:00,529 INFO L93 Difference]: Finished difference Result 8839 states and 13037 transitions. [2025-03-04 00:18:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:18:00,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 278 [2025-03-04 00:18:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:00,549 INFO L225 Difference]: With dead ends: 8839 [2025-03-04 00:18:00,549 INFO L226 Difference]: Without dead ends: 6289 [2025-03-04 00:18:00,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:18:00,554 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 1034 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:00,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1827 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:18:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2025-03-04 00:18:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 5219. [2025-03-04 00:18:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 4846 states have (on average 1.460998761865456) internal successors, (7080), 4852 states have internal predecessors, (7080), 312 states have call successors, (312), 60 states have call predecessors, (312), 60 states have return successors, (312), 306 states have call predecessors, (312), 312 states have call successors, (312) [2025-03-04 00:18:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 7704 transitions. [2025-03-04 00:18:00,841 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 7704 transitions. Word has length 278 [2025-03-04 00:18:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:00,842 INFO L471 AbstractCegarLoop]: Abstraction has 5219 states and 7704 transitions. [2025-03-04 00:18:00,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:18:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 7704 transitions. [2025-03-04 00:18:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-04 00:18:00,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:00,848 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:18:00,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:18:01,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:01,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1875727352, now seen corresponding path program 1 times [2025-03-04 00:18:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882645590] [2025-03-04 00:18:01,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:01,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 00:18:01,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 00:18:01,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:01,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 96 proven. 15 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:18:01,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882645590] [2025-03-04 00:18:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882645590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034213248] [2025-03-04 00:18:01,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:01,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:01,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:01,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:18:01,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:18:01,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 00:18:02,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 00:18:02,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:02,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:02,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 00:18:02,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:18:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1491 proven. 384 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2025-03-04 00:18:03,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:18:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 123 proven. 303 refuted. 0 times theorem prover too weak. 2386 trivial. 0 not checked. [2025-03-04 00:18:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034213248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:18:04,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:18:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21, 22] total 45 [2025-03-04 00:18:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678734372] [2025-03-04 00:18:04,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:18:04,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 00:18:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:04,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 00:18:04,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1647, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 00:18:04,487 INFO L87 Difference]: Start difference. First operand 5219 states and 7704 transitions. Second operand has 45 states, 44 states have (on average 5.204545454545454) internal successors, (229), 43 states have internal predecessors, (229), 10 states have call successors, (94), 5 states have call predecessors, (94), 11 states have return successors, (97), 10 states have call predecessors, (97), 10 states have call successors, (97) [2025-03-04 00:18:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:14,069 INFO L93 Difference]: Finished difference Result 20561 states and 29908 transitions. [2025-03-04 00:18:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2025-03-04 00:18:14,070 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.204545454545454) internal successors, (229), 43 states have internal predecessors, (229), 10 states have call successors, (94), 5 states have call predecessors, (94), 11 states have return successors, (97), 10 states have call predecessors, (97), 10 states have call successors, (97) Word has length 278 [2025-03-04 00:18:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:14,117 INFO L225 Difference]: With dead ends: 20561 [2025-03-04 00:18:14,117 INFO L226 Difference]: Without dead ends: 15345 [2025-03-04 00:18:14,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 536 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17746 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8353, Invalid=37657, Unknown=0, NotChecked=0, Total=46010 [2025-03-04 00:18:14,134 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 11145 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 3817 mSolverCounterSat, 2050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11145 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 5867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2050 IncrementalHoareTripleChecker+Valid, 3817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:14,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11145 Valid, 3878 Invalid, 5867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2050 Valid, 3817 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 00:18:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15345 states. [2025-03-04 00:18:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15345 to 9051. [2025-03-04 00:18:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9051 states, 8318 states have (on average 1.4508295263284443) internal successors, (12068), 8335 states have internal predecessors, (12068), 582 states have call successors, (582), 150 states have call predecessors, (582), 150 states have return successors, (582), 565 states have call predecessors, (582), 582 states have call successors, (582) [2025-03-04 00:18:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 13232 transitions. [2025-03-04 00:18:14,849 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 13232 transitions. Word has length 278 [2025-03-04 00:18:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:14,850 INFO L471 AbstractCegarLoop]: Abstraction has 9051 states and 13232 transitions. [2025-03-04 00:18:14,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.204545454545454) internal successors, (229), 43 states have internal predecessors, (229), 10 states have call successors, (94), 5 states have call predecessors, (94), 11 states have return successors, (97), 10 states have call predecessors, (97), 10 states have call successors, (97) [2025-03-04 00:18:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 13232 transitions. [2025-03-04 00:18:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-04 00:18:14,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:14,896 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:18:14,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 00:18:15,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:15,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash 172094420, now seen corresponding path program 1 times [2025-03-04 00:18:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:15,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047634726] [2025-03-04 00:18:15,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:15,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-04 00:18:15,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 00:18:15,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:15,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 27 proven. 84 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2025-03-04 00:18:17,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047634726] [2025-03-04 00:18:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047634726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332574209] [2025-03-04 00:18:17,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:17,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:17,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:17,674 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:18:17,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:18:17,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-04 00:18:17,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 00:18:17,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:17,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:17,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 00:18:17,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:18:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1608 proven. 174 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-04 00:18:19,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:18:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332574209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:21,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:18:21,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 26 [2025-03-04 00:18:21,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720594869] [2025-03-04 00:18:21,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:18:21,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 00:18:21,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:21,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 00:18:21,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 00:18:21,542 INFO L87 Difference]: Start difference. First operand 9051 states and 13232 transitions. Second operand has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 7 states have call successors, (66), 4 states have call predecessors, (66), 6 states have return successors, (68), 7 states have call predecessors, (68), 7 states have call successors, (68) [2025-03-04 00:18:32,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 00:18:35,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 00:18:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:40,108 INFO L93 Difference]: Finished difference Result 19991 states and 28781 transitions. [2025-03-04 00:18:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-04 00:18:40,110 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 7 states have call successors, (66), 4 states have call predecessors, (66), 6 states have return successors, (68), 7 states have call predecessors, (68), 7 states have call successors, (68) Word has length 279 [2025-03-04 00:18:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:40,135 INFO L225 Difference]: With dead ends: 19991 [2025-03-04 00:18:40,136 INFO L226 Difference]: Without dead ends: 10983 [2025-03-04 00:18:40,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4145 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2762, Invalid=12490, Unknown=0, NotChecked=0, Total=15252 [2025-03-04 00:18:40,150 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 3656 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 4426 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3658 SdHoareTripleChecker+Valid, 3593 SdHoareTripleChecker+Invalid, 5153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 4426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:40,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3658 Valid, 3593 Invalid, 5153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 4426 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2025-03-04 00:18:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2025-03-04 00:18:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 6289. [2025-03-04 00:18:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6289 states, 5620 states have (on average 1.411743772241993) internal successors, (7934), 5628 states have internal predecessors, (7934), 496 states have call successors, (496), 172 states have call predecessors, (496), 172 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-03-04 00:18:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6289 states to 6289 states and 8926 transitions. [2025-03-04 00:18:40,931 INFO L78 Accepts]: Start accepts. Automaton has 6289 states and 8926 transitions. Word has length 279 [2025-03-04 00:18:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:40,933 INFO L471 AbstractCegarLoop]: Abstraction has 6289 states and 8926 transitions. [2025-03-04 00:18:40,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 7 states have call successors, (66), 4 states have call predecessors, (66), 6 states have return successors, (68), 7 states have call predecessors, (68), 7 states have call successors, (68) [2025-03-04 00:18:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6289 states and 8926 transitions. [2025-03-04 00:18:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-04 00:18:40,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:40,939 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:18:40,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 00:18:41,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 00:18:41,140 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:41,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:41,141 INFO L85 PathProgramCache]: Analyzing trace with hash 470394715, now seen corresponding path program 1 times [2025-03-04 00:18:41,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:41,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497989226] [2025-03-04 00:18:41,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:41,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:41,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-04 00:18:41,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 00:18:41,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:41,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:18:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497989226] [2025-03-04 00:18:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497989226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:18:41,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:18:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:18:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691760609] [2025-03-04 00:18:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:18:41,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:18:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:41,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:18:41,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:18:41,510 INFO L87 Difference]: Start difference. First operand 6289 states and 8926 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:18:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:18:42,521 INFO L93 Difference]: Finished difference Result 14007 states and 19896 transitions. [2025-03-04 00:18:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:18:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 279 [2025-03-04 00:18:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:18:42,540 INFO L225 Difference]: With dead ends: 14007 [2025-03-04 00:18:42,540 INFO L226 Difference]: Without dead ends: 7721 [2025-03-04 00:18:42,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:18:42,550 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 244 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:18:42,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 726 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:18:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7721 states. [2025-03-04 00:18:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7721 to 5413. [2025-03-04 00:18:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5413 states, 4912 states have (on average 1.421416938110749) internal successors, (6982), 4916 states have internal predecessors, (6982), 368 states have call successors, (368), 132 states have call predecessors, (368), 132 states have return successors, (368), 364 states have call predecessors, (368), 368 states have call successors, (368) [2025-03-04 00:18:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 7718 transitions. [2025-03-04 00:18:43,268 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 7718 transitions. Word has length 279 [2025-03-04 00:18:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:18:43,268 INFO L471 AbstractCegarLoop]: Abstraction has 5413 states and 7718 transitions. [2025-03-04 00:18:43,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:18:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 7718 transitions. [2025-03-04 00:18:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-04 00:18:43,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:18:43,274 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:18:43,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:18:43,274 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:18:43,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:18:43,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1182365262, now seen corresponding path program 1 times [2025-03-04 00:18:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:18:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606210158] [2025-03-04 00:18:43,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:18:43,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-04 00:18:43,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 00:18:43,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:43,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 234 proven. 174 refuted. 0 times theorem prover too weak. 2404 trivial. 0 not checked. [2025-03-04 00:18:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:18:49,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606210158] [2025-03-04 00:18:49,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606210158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:18:49,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822706529] [2025-03-04 00:18:49,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:18:49,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:18:49,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:18:49,675 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:18:49,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 00:18:49,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-04 00:18:49,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 00:18:49,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:18:49,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:18:49,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 00:18:49,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:18:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1576 proven. 363 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-03-04 00:18:51,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:18:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 123 proven. 303 refuted. 0 times theorem prover too weak. 2386 trivial. 0 not checked. [2025-03-04 00:18:53,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822706529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:18:53,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:18:53,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 49 [2025-03-04 00:18:53,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243545794] [2025-03-04 00:18:53,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:18:53,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 00:18:53,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:18:53,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 00:18:53,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2041, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 00:18:53,005 INFO L87 Difference]: Start difference. First operand 5413 states and 7718 transitions. Second operand has 49 states, 48 states have (on average 5.0625) internal successors, (243), 49 states have internal predecessors, (243), 14 states have call successors, (100), 6 states have call predecessors, (100), 14 states have return successors, (101), 13 states have call predecessors, (101), 14 states have call successors, (101)