./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.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_fillercode_fillercodesize_ps-cn-500_file-88.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 1648b8247576116efcc38ecc57a34288105aaaa4b64d600c2638d97bcecc6c8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:12:05,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:12:05,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:12:05,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:12:05,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:12:05,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:12:05,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:12:05,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:12:05,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:12:05,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:12:05,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:12:05,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:12:05,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:12:05,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:12:05,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:12:05,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:05,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:12:05,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:12:05,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:12:05,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:12:05,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:12:05,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:12:05,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:12:05,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:12:05,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:12:05,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:12:05,929 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 -> 1648b8247576116efcc38ecc57a34288105aaaa4b64d600c2638d97bcecc6c8c [2025-03-03 20:12:06,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:12:06,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:12:06,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:12:06,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:12:06,163 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:12:06,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.i [2025-03-03 20:12:07,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b853cb9e2/648b1825253146c9bf43f3332649e14e/FLAG099ed6c8d [2025-03-03 20:12:07,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:12:07,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.i [2025-03-03 20:12:07,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b853cb9e2/648b1825253146c9bf43f3332649e14e/FLAG099ed6c8d [2025-03-03 20:12:07,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b853cb9e2/648b1825253146c9bf43f3332649e14e [2025-03-03 20:12:07,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:12:07,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:12:07,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:07,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:12:07,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:12:07,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:07" (1/1) ... [2025-03-03 20:12:07,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27901385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:07, skipping insertion in model container [2025-03-03 20:12:07,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:07" (1/1) ... [2025-03-03 20:12:07,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:12:08,079 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_fillercode_fillercodesize_ps-cn-500_file-88.i[916,929] [2025-03-03 20:12:08,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:08,265 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:12:08,275 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_fillercode_fillercodesize_ps-cn-500_file-88.i[916,929] [2025-03-03 20:12:08,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:08,388 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:12:08,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08 WrapperNode [2025-03-03 20:12:08,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:08,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:08,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:12:08,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:12:08,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,482 INFO L138 Inliner]: procedures = 26, calls = 128, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 877 [2025-03-03 20:12:08,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:08,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:12:08,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:12:08,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:12:08,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,544 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-03 20:12:08,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:12:08,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:12:08,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:12:08,607 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:12:08,608 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (1/1) ... [2025-03-03 20:12:08,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:08,637 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-03 20:12:08,640 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-03 20:12:08,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:12:08,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:12:08,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:12:08,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:12:08,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:12:08,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:12:08,779 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:12:08,780 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:12:09,564 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: havoc property_#t~bitwise88#1;havoc property_#t~ite90#1;havoc property_#t~bitwise89#1;havoc property_#t~short91#1; [2025-03-03 20:12:09,694 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 20:12:09,695 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:12:09,727 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:12:09,728 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-03 20:12:09,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:09 BoogieIcfgContainer [2025-03-03 20:12:09,728 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:12:09,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:12:09,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:12:09,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:12:09,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:12:07" (1/3) ... [2025-03-03 20:12:09,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a4993e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:09, skipping insertion in model container [2025-03-03 20:12:09,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:08" (2/3) ... [2025-03-03 20:12:09,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a4993e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:09, skipping insertion in model container [2025-03-03 20:12:09,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:09" (3/3) ... [2025-03-03 20:12:09,737 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-88.i [2025-03-03 20:12:09,748 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:12:09,750 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-88.i that has 2 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:12:09,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:12:09,819 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;@dcd7e54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:12:09,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:12:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 250 states have (on average 1.568) internal successors, (392), 251 states have internal predecessors, (392), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-03 20:12:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-03-03 20:12:09,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:09,888 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:09,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:09,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash -53040664, now seen corresponding path program 1 times [2025-03-03 20:12:09,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633004865] [2025-03-03 20:12:09,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-03-03 20:12:10,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-03-03 20:12:10,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:10,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 25992 trivial. 0 not checked. [2025-03-03 20:12:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633004865] [2025-03-03 20:12:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633004865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:10,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087222756] [2025-03-03 20:12:10,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:10,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:10,449 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-03 20:12:10,451 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-03 20:12:10,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-03-03 20:12:10,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-03-03 20:12:10,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:10,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:10,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:12:10,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:12:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 25992 trivial. 0 not checked. [2025-03-03 20:12:10,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:12:10,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087222756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:10,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:12:10,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:12:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032219400] [2025-03-03 20:12:10,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:10,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:12:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:12:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:12:10,923 INFO L87 Difference]: Start difference. First operand has 368 states, 250 states have (on average 1.568) internal successors, (392), 251 states have internal predecessors, (392), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) [2025-03-03 20:12:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:11,011 INFO L93 Difference]: Finished difference Result 727 states and 1350 transitions. [2025-03-03 20:12:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:12:11,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) Word has length 727 [2025-03-03 20:12:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:11,024 INFO L225 Difference]: With dead ends: 727 [2025-03-03 20:12:11,025 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 20:12:11,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 728 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-03 20:12:11,035 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:11,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 20:12:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-03-03 20:12:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 245 states have (on average 1.5551020408163265) internal successors, (381), 245 states have internal predecessors, (381), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-03 20:12:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 611 transitions. [2025-03-03 20:12:11,110 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 611 transitions. Word has length 727 [2025-03-03 20:12:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:11,111 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 611 transitions. [2025-03-03 20:12:11,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) [2025-03-03 20:12:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 611 transitions. [2025-03-03 20:12:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:11,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:11,127 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:11,137 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-03 20:12:11,331 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-03 20:12:11,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:11,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1055779298, now seen corresponding path program 1 times [2025-03-03 20:12:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369032824] [2025-03-03 20:12:11,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:11,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:11,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:11,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:11,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369032824] [2025-03-03 20:12:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369032824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:12,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:12,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514293034] [2025-03-03 20:12:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:12,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:12,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:12,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:12,085 INFO L87 Difference]: Start difference. First operand 362 states and 611 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:12,195 INFO L93 Difference]: Finished difference Result 973 states and 1648 transitions. [2025-03-03 20:12:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-03-03 20:12:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:12,203 INFO L225 Difference]: With dead ends: 973 [2025-03-03 20:12:12,203 INFO L226 Difference]: Without dead ends: 614 [2025-03-03 20:12:12,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:12,205 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 415 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:12,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1337 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-03 20:12:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2025-03-03 20:12:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 431 states have (on average 1.580046403712297) internal successors, (681), 432 states have internal predecessors, (681), 177 states have call successors, (177), 2 states have call predecessors, (177), 2 states have return successors, (177), 176 states have call predecessors, (177), 177 states have call successors, (177) [2025-03-03 20:12:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1035 transitions. [2025-03-03 20:12:12,268 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1035 transitions. Word has length 728 [2025-03-03 20:12:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:12,270 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1035 transitions. [2025-03-03 20:12:12,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1035 transitions. [2025-03-03 20:12:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:12,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:12,288 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:12,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:12:12,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 847080995, now seen corresponding path program 1 times [2025-03-03 20:12:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:12,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964585463] [2025-03-03 20:12:12,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:12,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:12,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:12,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:12,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:12,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964585463] [2025-03-03 20:12:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964585463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:12,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:12,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138167533] [2025-03-03 20:12:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:12,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:12,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:12,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:12,595 INFO L87 Difference]: Start difference. First operand 611 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:12,715 INFO L93 Difference]: Finished difference Result 1637 states and 2786 transitions. [2025-03-03 20:12:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:12,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-03-03 20:12:12,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:12,724 INFO L225 Difference]: With dead ends: 1637 [2025-03-03 20:12:12,725 INFO L226 Difference]: Without dead ends: 1029 [2025-03-03 20:12:12,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:12,727 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 369 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:12,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1398 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-03 20:12:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2025-03-03 20:12:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 783 states have (on average 1.6257982120051087) internal successors, (1273), 786 states have internal predecessors, (1273), 237 states have call successors, (237), 4 states have call predecessors, (237), 4 states have return successors, (237), 234 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-03 20:12:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1747 transitions. [2025-03-03 20:12:12,787 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1747 transitions. Word has length 728 [2025-03-03 20:12:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:12,789 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1747 transitions. [2025-03-03 20:12:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1747 transitions. [2025-03-03 20:12:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:12,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:12,795 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:12:12,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:12,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1476946844, now seen corresponding path program 1 times [2025-03-03 20:12:12,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:12,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361289116] [2025-03-03 20:12:12,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:12,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:12,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:12,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:12,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:12,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361289116] [2025-03-03 20:12:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361289116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:13,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376572353] [2025-03-03 20:12:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:13,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:13,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:13,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:13,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:13,070 INFO L87 Difference]: Start difference. First operand 1025 states and 1747 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:13,164 INFO L93 Difference]: Finished difference Result 2721 states and 4608 transitions. [2025-03-03 20:12:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-03-03 20:12:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:13,175 INFO L225 Difference]: With dead ends: 2721 [2025-03-03 20:12:13,175 INFO L226 Difference]: Without dead ends: 1699 [2025-03-03 20:12:13,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:13,180 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 380 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:13,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1236 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-03-03 20:12:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1696. [2025-03-03 20:12:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1228 states have (on average 1.5798045602605864) internal successors, (1940), 1235 states have internal predecessors, (1940), 459 states have call successors, (459), 8 states have call predecessors, (459), 8 states have return successors, (459), 452 states have call predecessors, (459), 459 states have call successors, (459) [2025-03-03 20:12:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2858 transitions. [2025-03-03 20:12:13,283 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2858 transitions. Word has length 728 [2025-03-03 20:12:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2858 transitions. [2025-03-03 20:12:13,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2858 transitions. [2025-03-03 20:12:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:13,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:13,293 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:13,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:12:13,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:13,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:13,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1793326531, now seen corresponding path program 1 times [2025-03-03 20:12:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:13,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210371480] [2025-03-03 20:12:13,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:13,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:13,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:13,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:13,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:13,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:13,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210371480] [2025-03-03 20:12:13,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210371480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:13,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:13,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358774075] [2025-03-03 20:12:13,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:13,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:13,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:13,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:13,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:13,747 INFO L87 Difference]: Start difference. First operand 1696 states and 2858 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:14,080 INFO L93 Difference]: Finished difference Result 5082 states and 8568 transitions. [2025-03-03 20:12:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:14,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-03-03 20:12:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:14,101 INFO L225 Difference]: With dead ends: 5082 [2025-03-03 20:12:14,101 INFO L226 Difference]: Without dead ends: 3389 [2025-03-03 20:12:14,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:14,108 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 660 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:14,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1177 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:12:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2025-03-03 20:12:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3387. [2025-03-03 20:12:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 2452 states have (on average 1.5774877650897228) internal successors, (3868), 2466 states have internal predecessors, (3868), 918 states have call successors, (918), 16 states have call predecessors, (918), 16 states have return successors, (918), 904 states have call predecessors, (918), 918 states have call successors, (918) [2025-03-03 20:12:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 5704 transitions. [2025-03-03 20:12:14,351 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 5704 transitions. Word has length 728 [2025-03-03 20:12:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:14,352 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 5704 transitions. [2025-03-03 20:12:14,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 5704 transitions. [2025-03-03 20:12:14,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:14,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:14,359 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:14,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:12:14,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:14,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:14,360 INFO L85 PathProgramCache]: Analyzing trace with hash -142333756, now seen corresponding path program 1 times [2025-03-03 20:12:14,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:14,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80551420] [2025-03-03 20:12:14,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:14,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:14,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:14,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:14,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:14,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:15,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:15,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80551420] [2025-03-03 20:12:15,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80551420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:15,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:15,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554239640] [2025-03-03 20:12:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:15,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:15,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:15,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:15,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:15,282 INFO L87 Difference]: Start difference. First operand 3387 states and 5704 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:16,736 INFO L93 Difference]: Finished difference Result 17317 states and 28817 transitions. [2025-03-03 20:12:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:12:16,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-03-03 20:12:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:16,817 INFO L225 Difference]: With dead ends: 17317 [2025-03-03 20:12:16,818 INFO L226 Difference]: Without dead ends: 13933 [2025-03-03 20:12:16,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:12:16,834 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 1413 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:16,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 2684 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:12:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2025-03-03 20:12:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 6363. [2025-03-03 20:12:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6363 states, 4588 states have (on average 1.5623365300784655) internal successors, (7168), 4618 states have internal predecessors, (7168), 1742 states have call successors, (1742), 32 states have call predecessors, (1742), 32 states have return successors, (1742), 1712 states have call predecessors, (1742), 1742 states have call successors, (1742) [2025-03-03 20:12:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6363 states to 6363 states and 10652 transitions. [2025-03-03 20:12:17,601 INFO L78 Accepts]: Start accepts. Automaton has 6363 states and 10652 transitions. Word has length 728 [2025-03-03 20:12:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:17,602 INFO L471 AbstractCegarLoop]: Abstraction has 6363 states and 10652 transitions. [2025-03-03 20:12:17,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6363 states and 10652 transitions. [2025-03-03 20:12:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:17,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:17,612 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:17,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:12:17,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:17,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:17,613 INFO L85 PathProgramCache]: Analyzing trace with hash -18260509, now seen corresponding path program 1 times [2025-03-03 20:12:17,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510476231] [2025-03-03 20:12:17,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:17,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:17,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:17,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:17,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:17,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:17,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510476231] [2025-03-03 20:12:17,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510476231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:17,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:17,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:17,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965956159] [2025-03-03 20:12:17,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:17,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:17,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:17,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:17,835 INFO L87 Difference]: Start difference. First operand 6363 states and 10652 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:18,615 INFO L93 Difference]: Finished difference Result 17805 states and 29678 transitions. [2025-03-03 20:12:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-03-03 20:12:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:18,698 INFO L225 Difference]: With dead ends: 17805 [2025-03-03 20:12:18,699 INFO L226 Difference]: Without dead ends: 11445 [2025-03-03 20:12:18,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:18,723 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 355 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:18,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1166 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11445 states. [2025-03-03 20:12:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11445 to 11435. [2025-03-03 20:12:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11435 states, 7996 states have (on average 1.5167583791895949) internal successors, (12128), 8058 states have internal predecessors, (12128), 3374 states have call successors, (3374), 64 states have call predecessors, (3374), 64 states have return successors, (3374), 3312 states have call predecessors, (3374), 3374 states have call successors, (3374) [2025-03-03 20:12:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11435 states to 11435 states and 18876 transitions. [2025-03-03 20:12:19,537 INFO L78 Accepts]: Start accepts. Automaton has 11435 states and 18876 transitions. Word has length 728 [2025-03-03 20:12:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:19,540 INFO L471 AbstractCegarLoop]: Abstraction has 11435 states and 18876 transitions. [2025-03-03 20:12:19,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 11435 states and 18876 transitions. [2025-03-03 20:12:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:19,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:19,555 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:19,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:12:19,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:19,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash -150093115, now seen corresponding path program 1 times [2025-03-03 20:12:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:19,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605455705] [2025-03-03 20:12:19,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:19,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:19,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:19,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:19,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605455705] [2025-03-03 20:12:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605455705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:19,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484885650] [2025-03-03 20:12:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:19,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:19,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:19,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:19,781 INFO L87 Difference]: Start difference. First operand 11435 states and 18876 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:20,375 INFO L93 Difference]: Finished difference Result 22889 states and 37766 transitions. [2025-03-03 20:12:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-03-03 20:12:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:20,432 INFO L225 Difference]: With dead ends: 22889 [2025-03-03 20:12:20,433 INFO L226 Difference]: Without dead ends: 11457 [2025-03-03 20:12:20,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:20,472 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 353 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:20,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1222 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11457 states. [2025-03-03 20:12:21,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11457 to 7479. [2025-03-03 20:12:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7479 states, 5708 states have (on average 1.5837421163279608) internal successors, (9040), 5738 states have internal predecessors, (9040), 1734 states have call successors, (1734), 36 states have call predecessors, (1734), 36 states have return successors, (1734), 1704 states have call predecessors, (1734), 1734 states have call successors, (1734) [2025-03-03 20:12:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 12508 transitions. [2025-03-03 20:12:21,389 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 12508 transitions. Word has length 728 [2025-03-03 20:12:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:21,390 INFO L471 AbstractCegarLoop]: Abstraction has 7479 states and 12508 transitions. [2025-03-03 20:12:21,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 12508 transitions. [2025-03-03 20:12:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:21,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:21,406 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:21,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:12:21,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:21,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash 875398884, now seen corresponding path program 1 times [2025-03-03 20:12:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:21,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469284001] [2025-03-03 20:12:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:21,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:21,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:21,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:21,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:24,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:24,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469284001] [2025-03-03 20:12:24,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469284001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:24,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:24,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:12:24,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414808897] [2025-03-03 20:12:24,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:24,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:12:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:24,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:12:24,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:12:24,569 INFO L87 Difference]: Start difference. First operand 7479 states and 12508 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 2 states have call predecessors, (115), 2 states have call successors, (115) [2025-03-03 20:12:29,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 20:12:33,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 20:12:37,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 20:12:41,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 20:12:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:43,861 INFO L93 Difference]: Finished difference Result 33739 states and 56244 transitions. [2025-03-03 20:12:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:12:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 2 states have call predecessors, (115), 2 states have call successors, (115) Word has length 728 [2025-03-03 20:12:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:43,955 INFO L225 Difference]: With dead ends: 33739 [2025-03-03 20:12:43,956 INFO L226 Difference]: Without dead ends: 26263 [2025-03-03 20:12:43,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:12:43,982 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 1325 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 437 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:43,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 2110 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 850 Invalid, 4 Unknown, 0 Unchecked, 17.3s Time] [2025-03-03 20:12:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26263 states. [2025-03-03 20:12:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26263 to 18257. [2025-03-03 20:12:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18257 states, 14696 states have (on average 1.618399564507349) internal successors, (23784), 14756 states have internal predecessors, (23784), 3468 states have call successors, (3468), 92 states have call predecessors, (3468), 92 states have return successors, (3468), 3408 states have call predecessors, (3468), 3468 states have call successors, (3468) [2025-03-03 20:12:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18257 states to 18257 states and 30720 transitions. [2025-03-03 20:12:45,193 INFO L78 Accepts]: Start accepts. Automaton has 18257 states and 30720 transitions. Word has length 728 [2025-03-03 20:12:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:45,194 INFO L471 AbstractCegarLoop]: Abstraction has 18257 states and 30720 transitions. [2025-03-03 20:12:45,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 2 states have call predecessors, (115), 2 states have call successors, (115) [2025-03-03 20:12:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 18257 states and 30720 transitions. [2025-03-03 20:12:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-03 20:12:45,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:45,215 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:12:45,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:12:45,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:45,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1313408387, now seen corresponding path program 1 times [2025-03-03 20:12:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185924920] [2025-03-03 20:12:45,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:45,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-03 20:12:45,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-03 20:12:45,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:45,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-03-03 20:12:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185924920] [2025-03-03 20:12:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185924920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:48,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:12:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150966148] [2025-03-03 20:12:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:48,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:12:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:48,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:12:48,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:12:48,057 INFO L87 Difference]: Start difference. First operand 18257 states and 30720 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-03-03 20:12:53,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 20:13:09,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 20:13:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:17,584 INFO L93 Difference]: Finished difference Result 215821 states and 362082 transitions. [2025-03-03 20:13:17,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:13:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-03-03 20:13:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:18,565 INFO L225 Difference]: With dead ends: 215821 [2025-03-03 20:13:18,566 INFO L226 Difference]: Without dead ends: 197567 [2025-03-03 20:13:18,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2025-03-03 20:13:18,698 INFO L435 NwaCegarLoop]: 1290 mSDtfsCounter, 4253 mSDsluCounter, 7124 mSDsCounter, 0 mSdLazyCounter, 4775 mSolverCounterSat, 1392 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 8414 SdHoareTripleChecker+Invalid, 6169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1392 IncrementalHoareTripleChecker+Valid, 4775 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:18,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4253 Valid, 8414 Invalid, 6169 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1392 Valid, 4775 Invalid, 2 Unknown, 0 Unchecked, 15.6s Time] [2025-03-03 20:13:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197567 states.