./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-100_file-69.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 7f7f9de4935e98a5cc03247cc1638e041ed42f1ff608f0c98afb88091964fc6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:39:04,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:39:04,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:39:04,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:39:04,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:39:04,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:39:04,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:39:04,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:39:04,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:39:04,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:39:04,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:39:04,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:39:04,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:39:04,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:39:04,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:39:04,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:39:04,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:39:04,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:39:04,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:39:04,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:39:04,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:39:04,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:39:04,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:39:04,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:39:04,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:39:04,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:39:04,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:39:04,899 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 -> 7f7f9de4935e98a5cc03247cc1638e041ed42f1ff608f0c98afb88091964fc6c [2025-03-08 10:39:05,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:39:05,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:39:05,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:39:05,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:39:05,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:39:05,145 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-100_file-69.i [2025-03-08 10:39:06,318 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8085306/fcba62c56e7b40f1b31232b66d35686d/FLAG3cc09a37c [2025-03-08 10:39:06,648 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:39:06,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-69.i [2025-03-08 10:39:06,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8085306/fcba62c56e7b40f1b31232b66d35686d/FLAG3cc09a37c [2025-03-08 10:39:06,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8085306/fcba62c56e7b40f1b31232b66d35686d [2025-03-08 10:39:06,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:39:06,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:39:06,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:39:06,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:39:06,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:39:06,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:06,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a54597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06, skipping insertion in model container [2025-03-08 10:39:06,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:06,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:39:06,817 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-100_file-69.i[916,929] [2025-03-08 10:39:06,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:39:06,891 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:39:06,902 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-100_file-69.i[916,929] [2025-03-08 10:39:06,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:39:06,949 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:39:06,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06 WrapperNode [2025-03-08 10:39:06,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:39:06,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:39:06,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:39:06,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:39:06,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:06,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,013 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 393 [2025-03-08 10:39:07,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:39:07,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:39:07,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:39:07,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:39:07,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,041 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-08 10:39:07,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:39:07,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:39:07,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:39:07,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:39:07,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (1/1) ... [2025-03-08 10:39:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:39:07,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:39:07,104 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-08 10:39:07,107 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-08 10:39:07,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:39:07,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:39:07,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:39:07,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:39:07,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:39:07,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:39:07,224 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:39:07,226 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:39:07,767 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 10:39:07,768 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:39:07,792 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:39:07,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:39:07,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:39:07 BoogieIcfgContainer [2025-03-08 10:39:07,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:39:07,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:39:07,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:39:07,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:39:07,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:39:06" (1/3) ... [2025-03-08 10:39:07,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3249bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:39:07, skipping insertion in model container [2025-03-08 10:39:07,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:39:06" (2/3) ... [2025-03-08 10:39:07,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3249bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:39:07, skipping insertion in model container [2025-03-08 10:39:07,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:39:07" (3/3) ... [2025-03-08 10:39:07,804 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-69.i [2025-03-08 10:39:07,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:39:07,817 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-69.i that has 2 procedures, 173 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:39:07,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:39:07,877 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;@27cba57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:39:07,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:39:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 99 states have internal predecessors, (137), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 10:39:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:39:07,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:07,904 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:07,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:07,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1106594724, now seen corresponding path program 1 times [2025-03-08 10:39:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270375016] [2025-03-08 10:39:07,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:08,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:39:08,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:39:08,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:08,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-03-08 10:39:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:08,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270375016] [2025-03-08 10:39:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270375016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:39:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274683444] [2025-03-08 10:39:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:08,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:39:08,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:39:08,354 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-08 10:39:08,356 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-08 10:39:08,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:39:08,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:39:08,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:08,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:08,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:39:08,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:39:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-03-08 10:39:08,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:39:08,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274683444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:39:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:39:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105050327] [2025-03-08 10:39:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:08,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:39:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:08,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:39:08,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:39:08,704 INFO L87 Difference]: Start difference. First operand has 173 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 99 states have internal predecessors, (137), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-08 10:39:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:08,758 INFO L93 Difference]: Finished difference Result 340 states and 629 transitions. [2025-03-08 10:39:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:39:08,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 434 [2025-03-08 10:39:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:08,767 INFO L225 Difference]: With dead ends: 340 [2025-03-08 10:39:08,769 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 10:39:08,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 435 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-08 10:39:08,777 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:08,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:39:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 10:39:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-08 10:39:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 10:39:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 276 transitions. [2025-03-08 10:39:08,832 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 276 transitions. Word has length 434 [2025-03-08 10:39:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:08,832 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 276 transitions. [2025-03-08 10:39:08,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-08 10:39:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 276 transitions. [2025-03-08 10:39:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:39:08,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:08,842 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:08,850 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-08 10:39:09,043 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-08 10:39:09,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:09,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash -562020196, now seen corresponding path program 1 times [2025-03-08 10:39:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:09,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773978646] [2025-03-08 10:39:09,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:09,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:39:09,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:39:09,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:09,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:09,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773978646] [2025-03-08 10:39:09,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773978646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:09,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:09,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:39:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041932403] [2025-03-08 10:39:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:09,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:39:09,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:09,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:39:09,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:39:09,412 INFO L87 Difference]: Start difference. First operand 170 states and 276 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:09,494 INFO L93 Difference]: Finished difference Result 437 states and 711 transitions. [2025-03-08 10:39:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:39:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-03-08 10:39:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:09,498 INFO L225 Difference]: With dead ends: 437 [2025-03-08 10:39:09,498 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 10:39:09,499 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-08 10:39:09,500 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 153 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:09,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 665 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:39:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 10:39:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2025-03-08 10:39:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 163 states have (on average 1.4171779141104295) internal successors, (231), 164 states have internal predecessors, (231), 101 states have call successors, (101), 2 states have call predecessors, (101), 2 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-08 10:39:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 433 transitions. [2025-03-08 10:39:09,545 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 433 transitions. Word has length 434 [2025-03-08 10:39:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:09,547 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 433 transitions. [2025-03-08 10:39:09,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 433 transitions. [2025-03-08 10:39:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:39:09,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:09,553 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:09,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:39:09,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:09,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:09,555 INFO L85 PathProgramCache]: Analyzing trace with hash -211220259, now seen corresponding path program 1 times [2025-03-08 10:39:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:09,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604281169] [2025-03-08 10:39:09,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:09,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:39:09,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:39:09,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:09,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:10,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:10,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604281169] [2025-03-08 10:39:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604281169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:10,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:10,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:39:10,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738499874] [2025-03-08 10:39:10,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:10,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:39:10,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:10,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:39:10,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:39:10,031 INFO L87 Difference]: Start difference. First operand 267 states and 433 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:10,403 INFO L93 Difference]: Finished difference Result 748 states and 1218 transitions. [2025-03-08 10:39:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:39:10,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-03-08 10:39:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:10,411 INFO L225 Difference]: With dead ends: 748 [2025-03-08 10:39:10,411 INFO L226 Difference]: Without dead ends: 484 [2025-03-08 10:39:10,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:39:10,415 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 183 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:10,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1054 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:39:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-08 10:39:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 450. [2025-03-08 10:39:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 273 states have (on average 1.424908424908425) internal successors, (389), 274 states have internal predecessors, (389), 173 states have call successors, (173), 3 states have call predecessors, (173), 3 states have return successors, (173), 172 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 10:39:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 735 transitions. [2025-03-08 10:39:10,510 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 735 transitions. Word has length 434 [2025-03-08 10:39:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:10,512 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 735 transitions. [2025-03-08 10:39:10,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 735 transitions. [2025-03-08 10:39:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:39:10,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:10,517 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:10,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:39:10,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:10,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 82182748, now seen corresponding path program 1 times [2025-03-08 10:39:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:10,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035497623] [2025-03-08 10:39:10,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:10,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:39:10,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:39:10,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:10,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035497623] [2025-03-08 10:39:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035497623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:10,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:39:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232969545] [2025-03-08 10:39:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:10,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:39:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:10,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:39:10,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:39:10,727 INFO L87 Difference]: Start difference. First operand 450 states and 735 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:10,920 INFO L93 Difference]: Finished difference Result 1031 states and 1685 transitions. [2025-03-08 10:39:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:39:10,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-03-08 10:39:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:10,925 INFO L225 Difference]: With dead ends: 1031 [2025-03-08 10:39:10,925 INFO L226 Difference]: Without dead ends: 711 [2025-03-08 10:39:10,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:39:10,927 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 165 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:10,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 700 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:39:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-08 10:39:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 708. [2025-03-08 10:39:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 466 states have (on average 1.4678111587982832) internal successors, (684), 469 states have internal predecessors, (684), 235 states have call successors, (235), 6 states have call predecessors, (235), 6 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) [2025-03-08 10:39:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1154 transitions. [2025-03-08 10:39:10,971 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1154 transitions. Word has length 434 [2025-03-08 10:39:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:10,972 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1154 transitions. [2025-03-08 10:39:10,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1154 transitions. [2025-03-08 10:39:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:39:10,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:10,976 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:10,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:39:10,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:10,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash -172553797, now seen corresponding path program 1 times [2025-03-08 10:39:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:10,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120138329] [2025-03-08 10:39:10,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:11,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:39:11,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:39:11,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:11,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120138329] [2025-03-08 10:39:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120138329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:11,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:39:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487442883] [2025-03-08 10:39:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:11,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:39:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:11,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:39:11,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:39:11,381 INFO L87 Difference]: Start difference. First operand 708 states and 1154 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:12,144 INFO L93 Difference]: Finished difference Result 1592 states and 2580 transitions. [2025-03-08 10:39:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:39:12,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-03-08 10:39:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:12,152 INFO L225 Difference]: With dead ends: 1592 [2025-03-08 10:39:12,153 INFO L226 Difference]: Without dead ends: 1118 [2025-03-08 10:39:12,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:39:12,159 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 437 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:12,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1252 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:39:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-08 10:39:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 907. [2025-03-08 10:39:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 603 states have (on average 1.4676616915422886) internal successors, (885), 608 states have internal predecessors, (885), 295 states have call successors, (295), 8 states have call predecessors, (295), 8 states have return successors, (295), 290 states have call predecessors, (295), 295 states have call successors, (295) [2025-03-08 10:39:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1475 transitions. [2025-03-08 10:39:12,271 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1475 transitions. Word has length 434 [2025-03-08 10:39:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:12,274 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1475 transitions. [2025-03-08 10:39:12,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1475 transitions. [2025-03-08 10:39:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:39:12,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:12,277 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:12,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:39:12,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:12,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1169626150, now seen corresponding path program 1 times [2025-03-08 10:39:12,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:12,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101753614] [2025-03-08 10:39:12,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:12,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:39:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:39:12,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:12,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101753614] [2025-03-08 10:39:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101753614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:39:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307080623] [2025-03-08 10:39:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:12,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:39:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:12,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:39:12,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:39:12,516 INFO L87 Difference]: Start difference. First operand 907 states and 1475 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:12,923 INFO L93 Difference]: Finished difference Result 2727 states and 4437 transitions. [2025-03-08 10:39:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:39:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 434 [2025-03-08 10:39:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:12,936 INFO L225 Difference]: With dead ends: 2727 [2025-03-08 10:39:12,936 INFO L226 Difference]: Without dead ends: 2002 [2025-03-08 10:39:12,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08 10:39:12,940 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 331 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:12,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 611 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:39:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-03-08 10:39:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1254. [2025-03-08 10:39:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 887 states have (on average 1.5186020293122886) internal successors, (1347), 894 states have internal predecessors, (1347), 355 states have call successors, (355), 11 states have call predecessors, (355), 11 states have return successors, (355), 348 states have call predecessors, (355), 355 states have call successors, (355) [2025-03-08 10:39:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 2057 transitions. [2025-03-08 10:39:13,059 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 2057 transitions. Word has length 434 [2025-03-08 10:39:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:13,060 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 2057 transitions. [2025-03-08 10:39:13,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 2057 transitions. [2025-03-08 10:39:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:39:13,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:13,064 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:13,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:39:13,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:13,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1087284857, now seen corresponding path program 1 times [2025-03-08 10:39:13,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:13,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922685910] [2025-03-08 10:39:13,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:13,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:13,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:39:13,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:39:13,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:13,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922685910] [2025-03-08 10:39:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922685910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:39:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810253949] [2025-03-08 10:39:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:13,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:39:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:13,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:39:13,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:39:13,263 INFO L87 Difference]: Start difference. First operand 1254 states and 2057 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-08 10:39:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:13,517 INFO L93 Difference]: Finished difference Result 3204 states and 5233 transitions. [2025-03-08 10:39:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:39:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 434 [2025-03-08 10:39:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:13,536 INFO L225 Difference]: With dead ends: 3204 [2025-03-08 10:39:13,537 INFO L226 Difference]: Without dead ends: 2252 [2025-03-08 10:39:13,540 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-08 10:39:13,541 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 297 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:13,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 566 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:39:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2025-03-08 10:39:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2250. [2025-03-08 10:39:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 1592 states have (on average 1.5012562814070352) internal successors, (2390), 1606 states have internal predecessors, (2390), 638 states have call successors, (638), 19 states have call predecessors, (638), 19 states have return successors, (638), 624 states have call predecessors, (638), 638 states have call successors, (638) [2025-03-08 10:39:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3666 transitions. [2025-03-08 10:39:13,775 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3666 transitions. Word has length 434 [2025-03-08 10:39:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:13,777 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3666 transitions. [2025-03-08 10:39:13,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-08 10:39:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3666 transitions. [2025-03-08 10:39:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 10:39:13,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:13,780 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:13,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:39:13,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1262889449, now seen corresponding path program 1 times [2025-03-08 10:39:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724402060] [2025-03-08 10:39:13,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:13,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 10:39:13,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 10:39:13,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:13,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724402060] [2025-03-08 10:39:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724402060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:14,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:14,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:39:14,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032774053] [2025-03-08 10:39:14,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:14,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:39:14,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:14,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:39:14,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:39:14,081 INFO L87 Difference]: Start difference. First operand 2250 states and 3666 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:14,356 INFO L93 Difference]: Finished difference Result 4002 states and 6478 transitions. [2025-03-08 10:39:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:39:14,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-03-08 10:39:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:14,373 INFO L225 Difference]: With dead ends: 4002 [2025-03-08 10:39:14,373 INFO L226 Difference]: Without dead ends: 3009 [2025-03-08 10:39:14,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-08 10:39:14,376 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 169 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:14,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 512 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:39:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2025-03-08 10:39:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2996. [2025-03-08 10:39:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2061 states have (on average 1.4560892770499758) internal successors, (3001), 2083 states have internal predecessors, (3001), 898 states have call successors, (898), 36 states have call predecessors, (898), 36 states have return successors, (898), 876 states have call predecessors, (898), 898 states have call successors, (898) [2025-03-08 10:39:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 4797 transitions. [2025-03-08 10:39:14,642 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 4797 transitions. Word has length 435 [2025-03-08 10:39:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:14,643 INFO L471 AbstractCegarLoop]: Abstraction has 2996 states and 4797 transitions. [2025-03-08 10:39:14,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 4797 transitions. [2025-03-08 10:39:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 10:39:14,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:14,647 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:14,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:39:14,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:14,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1422014972, now seen corresponding path program 1 times [2025-03-08 10:39:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:14,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260489949] [2025-03-08 10:39:14,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:14,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 10:39:14,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 10:39:14,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:14,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:15,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:15,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260489949] [2025-03-08 10:39:15,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260489949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:15,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:15,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:39:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90763924] [2025-03-08 10:39:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:15,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:39:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:15,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:39:15,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:39:15,117 INFO L87 Difference]: Start difference. First operand 2996 states and 4797 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:16,470 INFO L93 Difference]: Finished difference Result 8516 states and 13590 transitions. [2025-03-08 10:39:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:39:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-03-08 10:39:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:16,504 INFO L225 Difference]: With dead ends: 8516 [2025-03-08 10:39:16,504 INFO L226 Difference]: Without dead ends: 6053 [2025-03-08 10:39:16,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:39:16,517 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 544 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:16,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1091 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 10:39:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2025-03-08 10:39:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 6025. [2025-03-08 10:39:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 4090 states have (on average 1.4420537897310512) internal successors, (5898), 4138 states have internal predecessors, (5898), 1856 states have call successors, (1856), 78 states have call predecessors, (1856), 78 states have return successors, (1856), 1808 states have call predecessors, (1856), 1856 states have call successors, (1856) [2025-03-08 10:39:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 9610 transitions. [2025-03-08 10:39:17,050 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 9610 transitions. Word has length 435 [2025-03-08 10:39:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:17,050 INFO L471 AbstractCegarLoop]: Abstraction has 6025 states and 9610 transitions. [2025-03-08 10:39:17,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 9610 transitions. [2025-03-08 10:39:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 10:39:17,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:17,055 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:17,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:39:17,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:17,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:17,056 INFO L85 PathProgramCache]: Analyzing trace with hash -253374202, now seen corresponding path program 1 times [2025-03-08 10:39:17,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:17,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897772142] [2025-03-08 10:39:17,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:17,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 10:39:17,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 10:39:17,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:17,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:17,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:17,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897772142] [2025-03-08 10:39:17,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897772142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:17,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:17,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:39:17,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912926029] [2025-03-08 10:39:17,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:17,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:39:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:17,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:39:17,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:39:17,153 INFO L87 Difference]: Start difference. First operand 6025 states and 9610 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:17,595 INFO L93 Difference]: Finished difference Result 10061 states and 15995 transitions. [2025-03-08 10:39:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:39:17,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-03-08 10:39:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:17,629 INFO L225 Difference]: With dead ends: 10061 [2025-03-08 10:39:17,629 INFO L226 Difference]: Without dead ends: 4657 [2025-03-08 10:39:17,649 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-08 10:39:17,649 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 155 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:17,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 537 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:39:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2025-03-08 10:39:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4655. [2025-03-08 10:39:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4655 states, 3181 states have (on average 1.4319396416221315) internal successors, (4555), 3213 states have internal predecessors, (4555), 1392 states have call successors, (1392), 81 states have call predecessors, (1392), 81 states have return successors, (1392), 1360 states have call predecessors, (1392), 1392 states have call successors, (1392) [2025-03-08 10:39:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4655 states to 4655 states and 7339 transitions. [2025-03-08 10:39:18,032 INFO L78 Accepts]: Start accepts. Automaton has 4655 states and 7339 transitions. Word has length 435 [2025-03-08 10:39:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:18,032 INFO L471 AbstractCegarLoop]: Abstraction has 4655 states and 7339 transitions. [2025-03-08 10:39:18,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4655 states and 7339 transitions. [2025-03-08 10:39:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 10:39:18,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:18,036 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:18,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:39:18,036 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:18,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1964383751, now seen corresponding path program 1 times [2025-03-08 10:39:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:18,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440828089] [2025-03-08 10:39:18,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:18,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 10:39:18,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 10:39:18,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:18,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440828089] [2025-03-08 10:39:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440828089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:18,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:39:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275001199] [2025-03-08 10:39:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:18,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:39:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:18,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:39:18,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:39:18,258 INFO L87 Difference]: Start difference. First operand 4655 states and 7339 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:19,089 INFO L93 Difference]: Finished difference Result 9198 states and 14421 transitions. [2025-03-08 10:39:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:39:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-03-08 10:39:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:19,121 INFO L225 Difference]: With dead ends: 9198 [2025-03-08 10:39:19,121 INFO L226 Difference]: Without dead ends: 7332 [2025-03-08 10:39:19,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:39:19,128 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 348 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:19,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1244 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:39:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2025-03-08 10:39:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 5002. [2025-03-08 10:39:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5002 states, 3384 states have (on average 1.422872340425532) internal successors, (4815), 3420 states have internal predecessors, (4815), 1524 states have call successors, (1524), 93 states have call predecessors, (1524), 93 states have return successors, (1524), 1488 states have call predecessors, (1524), 1524 states have call successors, (1524) [2025-03-08 10:39:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5002 states to 5002 states and 7863 transitions. [2025-03-08 10:39:19,573 INFO L78 Accepts]: Start accepts. Automaton has 5002 states and 7863 transitions. Word has length 435 [2025-03-08 10:39:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:19,574 INFO L471 AbstractCegarLoop]: Abstraction has 5002 states and 7863 transitions. [2025-03-08 10:39:19,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5002 states and 7863 transitions. [2025-03-08 10:39:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 10:39:19,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:19,579 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:19,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:39:19,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash 967311398, now seen corresponding path program 1 times [2025-03-08 10:39:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:19,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615823401] [2025-03-08 10:39:19,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:19,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:19,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 10:39:19,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 10:39:19,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:20,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:20,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615823401] [2025-03-08 10:39:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615823401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:20,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:20,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:39:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301965349] [2025-03-08 10:39:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:20,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:39:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:20,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:39:20,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:39:20,006 INFO L87 Difference]: Start difference. First operand 5002 states and 7863 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:20,835 INFO L93 Difference]: Finished difference Result 9391 states and 14754 transitions. [2025-03-08 10:39:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:39:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 435 [2025-03-08 10:39:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:20,867 INFO L225 Difference]: With dead ends: 9391 [2025-03-08 10:39:20,867 INFO L226 Difference]: Without dead ends: 5031 [2025-03-08 10:39:20,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:39:20,886 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 315 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:20,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1111 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:39:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2025-03-08 10:39:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 4821. [2025-03-08 10:39:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 3203 states have (on average 1.4071183265688416) internal successors, (4507), 3239 states have internal predecessors, (4507), 1524 states have call successors, (1524), 93 states have call predecessors, (1524), 93 states have return successors, (1524), 1488 states have call predecessors, (1524), 1524 states have call successors, (1524) [2025-03-08 10:39:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7555 transitions. [2025-03-08 10:39:21,231 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7555 transitions. Word has length 435 [2025-03-08 10:39:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:21,232 INFO L471 AbstractCegarLoop]: Abstraction has 4821 states and 7555 transitions. [2025-03-08 10:39:21,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7555 transitions. [2025-03-08 10:39:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 10:39:21,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:21,236 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:21,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:39:21,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:21,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash 805828604, now seen corresponding path program 1 times [2025-03-08 10:39:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:21,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792512565] [2025-03-08 10:39:21,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:21,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:21,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:39:21,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:39:21,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:21,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 156 proven. 57 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-08 10:39:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792512565] [2025-03-08 10:39:22,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792512565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:39:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452324752] [2025-03-08 10:39:22,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:39:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:39:22,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:39:22,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:39:22,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:39:22,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:39:22,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:22,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:22,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 10:39:22,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:39:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 5502 proven. 324 refuted. 0 times theorem prover too weak. 4398 trivial. 0 not checked. [2025-03-08 10:39:24,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:39:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 297 proven. 333 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-03-08 10:39:26,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452324752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:39:26,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:39:26,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 18] total 37 [2025-03-08 10:39:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213132837] [2025-03-08 10:39:26,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:39:26,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 10:39:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:26,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 10:39:26,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 10:39:26,691 INFO L87 Difference]: Start difference. First operand 4821 states and 7555 transitions. Second operand has 37 states, 37 states have (on average 5.513513513513513) internal successors, (204), 37 states have internal predecessors, (204), 11 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (184), 11 states have call predecessors, (184), 11 states have call successors, (184) [2025-03-08 10:39:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:51,599 INFO L93 Difference]: Finished difference Result 29587 states and 45232 transitions. [2025-03-08 10:39:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2025-03-08 10:39:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.513513513513513) internal successors, (204), 37 states have internal predecessors, (204), 11 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (184), 11 states have call predecessors, (184), 11 states have call successors, (184) Word has length 436 [2025-03-08 10:39:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:51,707 INFO L225 Difference]: With dead ends: 29587 [2025-03-08 10:39:51,708 INFO L226 Difference]: Without dead ends: 25003 [2025-03-08 10:39:51,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1149 GetRequests, 889 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27802 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=12377, Invalid=56005, Unknown=0, NotChecked=0, Total=68382 [2025-03-08 10:39:51,741 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 5464 mSDsluCounter, 6443 mSDsCounter, 0 mSdLazyCounter, 10074 mSolverCounterSat, 4159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5526 SdHoareTripleChecker+Valid, 7164 SdHoareTripleChecker+Invalid, 14233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4159 IncrementalHoareTripleChecker+Valid, 10074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:51,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5526 Valid, 7164 Invalid, 14233 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4159 Valid, 10074 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-03-08 10:39:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25003 states. [2025-03-08 10:39:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25003 to 3188. [2025-03-08 10:39:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3188 states, 2480 states have (on average 1.4778225806451613) internal successors, (3665), 2480 states have internal predecessors, (3665), 648 states have call successors, (648), 59 states have call predecessors, (648), 59 states have return successors, (648), 648 states have call predecessors, (648), 648 states have call successors, (648) [2025-03-08 10:39:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4961 transitions. [2025-03-08 10:39:52,809 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4961 transitions. Word has length 436 [2025-03-08 10:39:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:52,810 INFO L471 AbstractCegarLoop]: Abstraction has 3188 states and 4961 transitions. [2025-03-08 10:39:52,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.513513513513513) internal successors, (204), 37 states have internal predecessors, (204), 11 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (184), 11 states have call predecessors, (184), 11 states have call successors, (184) [2025-03-08 10:39:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4961 transitions. [2025-03-08 10:39:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 10:39:52,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:52,812 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:52,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:39:53,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 10:39:53,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:53,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash 725306905, now seen corresponding path program 1 times [2025-03-08 10:39:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:53,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959858729] [2025-03-08 10:39:53,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:53,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:39:53,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:39:53,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:53,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:53,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959858729] [2025-03-08 10:39:53,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959858729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:53,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:53,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:39:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844068991] [2025-03-08 10:39:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:53,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:39:53,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:53,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:39:53,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:39:53,273 INFO L87 Difference]: Start difference. First operand 3188 states and 4961 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:54,734 INFO L93 Difference]: Finished difference Result 8228 states and 12816 transitions. [2025-03-08 10:39:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:39:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 436 [2025-03-08 10:39:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:54,752 INFO L225 Difference]: With dead ends: 8228 [2025-03-08 10:39:54,752 INFO L226 Difference]: Without dead ends: 5447 [2025-03-08 10:39:54,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:39:54,759 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 463 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:54,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 638 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:39:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2025-03-08 10:39:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 3208. [2025-03-08 10:39:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 2500 states have (on average 1.478) internal successors, (3695), 2500 states have internal predecessors, (3695), 648 states have call successors, (648), 59 states have call predecessors, (648), 59 states have return successors, (648), 648 states have call predecessors, (648), 648 states have call successors, (648) [2025-03-08 10:39:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4991 transitions. [2025-03-08 10:39:55,249 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4991 transitions. Word has length 436 [2025-03-08 10:39:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:55,250 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 4991 transitions. [2025-03-08 10:39:55,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:39:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4991 transitions. [2025-03-08 10:39:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 10:39:55,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:55,254 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:55,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:39:55,254 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:55,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:55,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2030111766, now seen corresponding path program 1 times [2025-03-08 10:39:55,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:55,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837572895] [2025-03-08 10:39:55,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:55,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:55,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:39:55,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:39:55,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:55,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:39:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:55,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837572895] [2025-03-08 10:39:55,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837572895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:55,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:55,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 10:39:55,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178952263] [2025-03-08 10:39:55,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:55,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 10:39:55,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:55,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 10:39:55,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:39:55,968 INFO L87 Difference]: Start difference. First operand 3208 states and 4991 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-08 10:39:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:58,767 INFO L93 Difference]: Finished difference Result 8953 states and 13899 transitions. [2025-03-08 10:39:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:39:58,767 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 436 [2025-03-08 10:39:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:58,784 INFO L225 Difference]: With dead ends: 8953 [2025-03-08 10:39:58,784 INFO L226 Difference]: Without dead ends: 7641 [2025-03-08 10:39:58,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-08 10:39:58,787 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 858 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:58,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 2111 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:39:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2025-03-08 10:39:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 4656. [2025-03-08 10:39:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4656 states, 3636 states have (on average 1.4898239823982398) internal successors, (5417), 3636 states have internal predecessors, (5417), 936 states have call successors, (936), 83 states have call predecessors, (936), 83 states have return successors, (936), 936 states have call predecessors, (936), 936 states have call successors, (936) [2025-03-08 10:39:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 7289 transitions. [2025-03-08 10:39:59,537 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 7289 transitions. Word has length 436 [2025-03-08 10:39:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:59,538 INFO L471 AbstractCegarLoop]: Abstraction has 4656 states and 7289 transitions. [2025-03-08 10:39:59,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-08 10:39:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 7289 transitions. [2025-03-08 10:39:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 10:39:59,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:59,541 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:39:59,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 10:39:59,541 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:59,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1210182092, now seen corresponding path program 1 times [2025-03-08 10:39:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532563214] [2025-03-08 10:39:59,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:59,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:39:59,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:39:59,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:59,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:40:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:40:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:40:00,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532563214] [2025-03-08 10:40:00,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532563214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:40:00,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:40:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:40:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34110780] [2025-03-08 10:40:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:40:00,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:40:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:40:00,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:40:00,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:40:00,080 INFO L87 Difference]: Start difference. First operand 4656 states and 7289 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:40:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:40:02,161 INFO L93 Difference]: Finished difference Result 8440 states and 13130 transitions. [2025-03-08 10:40:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:40:02,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 436 [2025-03-08 10:40:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:40:02,177 INFO L225 Difference]: With dead ends: 8440 [2025-03-08 10:40:02,178 INFO L226 Difference]: Without dead ends: 6462 [2025-03-08 10:40:02,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:40:02,182 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 596 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:40:02,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 2143 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:40:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2025-03-08 10:40:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 4674. [2025-03-08 10:40:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 3654 states have (on average 1.4898741105637658) internal successors, (5444), 3654 states have internal predecessors, (5444), 936 states have call successors, (936), 83 states have call predecessors, (936), 83 states have return successors, (936), 936 states have call predecessors, (936), 936 states have call successors, (936) [2025-03-08 10:40:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 7316 transitions. [2025-03-08 10:40:03,208 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 7316 transitions. Word has length 436 [2025-03-08 10:40:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:40:03,208 INFO L471 AbstractCegarLoop]: Abstraction has 4674 states and 7316 transitions. [2025-03-08 10:40:03,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:40:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 7316 transitions. [2025-03-08 10:40:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-08 10:40:03,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:40:03,211 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:40:03,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 10:40:03,211 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:40:03,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:40:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -376006393, now seen corresponding path program 1 times [2025-03-08 10:40:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:40:03,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450544945] [2025-03-08 10:40:03,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:40:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:40:03,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 10:40:03,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 10:40:03,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:40:03,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:40:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:40:03,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:40:03,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450544945] [2025-03-08 10:40:03,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450544945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:40:03,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:40:03,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:40:03,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344391218] [2025-03-08 10:40:03,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:40:03,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:40:03,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:40:03,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:40:03,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:40:03,471 INFO L87 Difference]: Start difference. First operand 4674 states and 7316 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:40:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:40:05,104 INFO L93 Difference]: Finished difference Result 6869 states and 10766 transitions. [2025-03-08 10:40:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:40:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 437 [2025-03-08 10:40:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:40:05,120 INFO L225 Difference]: With dead ends: 6869 [2025-03-08 10:40:05,120 INFO L226 Difference]: Without dead ends: 5501 [2025-03-08 10:40:05,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:40:05,124 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 409 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:40:05,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1446 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:40:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5501 states. [2025-03-08 10:40:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5501 to 4736. [2025-03-08 10:40:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4736 states, 3716 states have (on average 1.493810548977395) internal successors, (5551), 3716 states have internal predecessors, (5551), 936 states have call successors, (936), 83 states have call predecessors, (936), 83 states have return successors, (936), 936 states have call predecessors, (936), 936 states have call successors, (936) [2025-03-08 10:40:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 7423 transitions. [2025-03-08 10:40:05,952 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 7423 transitions. Word has length 437 [2025-03-08 10:40:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:40:05,953 INFO L471 AbstractCegarLoop]: Abstraction has 4736 states and 7423 transitions. [2025-03-08 10:40:05,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:40:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 7423 transitions. [2025-03-08 10:40:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-08 10:40:05,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:40:05,955 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:40:05,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 10:40:05,956 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:40:05,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:40:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 792634377, now seen corresponding path program 1 times [2025-03-08 10:40:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:40:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136632375] [2025-03-08 10:40:05,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:40:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:40:05,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 10:40:05,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 10:40:05,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:40:05,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:40:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-08 10:40:06,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:40:06,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136632375] [2025-03-08 10:40:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136632375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:40:06,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:40:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:40:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409645677] [2025-03-08 10:40:06,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:40:06,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:40:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:40:06,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:40:06,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:40:06,091 INFO L87 Difference]: Start difference. First operand 4736 states and 7423 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:40:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:40:08,788 INFO L93 Difference]: Finished difference Result 14663 states and 22795 transitions. [2025-03-08 10:40:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:40:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 437 [2025-03-08 10:40:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:40:08,817 INFO L225 Difference]: With dead ends: 14663 [2025-03-08 10:40:08,817 INFO L226 Difference]: Without dead ends: 10330 [2025-03-08 10:40:08,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:40:08,827 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 438 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:40:08,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 772 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:40:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10330 states. [2025-03-08 10:40:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10330 to 5074. [2025-03-08 10:40:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 4054 states have (on average 1.489146521953626) internal successors, (6037), 4054 states have internal predecessors, (6037), 936 states have call successors, (936), 83 states have call predecessors, (936), 83 states have return successors, (936), 936 states have call predecessors, (936), 936 states have call successors, (936) [2025-03-08 10:40:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 7909 transitions. [2025-03-08 10:40:09,679 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 7909 transitions. Word has length 437 [2025-03-08 10:40:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:40:09,679 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 7909 transitions. [2025-03-08 10:40:09,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-08 10:40:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 7909 transitions. [2025-03-08 10:40:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-08 10:40:09,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:40:09,682 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:40:09,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 10:40:09,682 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:40:09,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:40:09,683 INFO L85 PathProgramCache]: Analyzing trace with hash 803950504, now seen corresponding path program 1 times [2025-03-08 10:40:09,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:40:09,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936994565] [2025-03-08 10:40:09,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:40:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:40:09,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 10:40:09,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 10:40:09,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:40:09,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:40:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 309 proven. 312 refuted. 0 times theorem prover too weak. 9603 trivial. 0 not checked. [2025-03-08 10:40:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:40:10,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936994565] [2025-03-08 10:40:10,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936994565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:40:10,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484529455] [2025-03-08 10:40:10,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:40:10,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:40:10,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:40:10,451 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:40:10,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:40:10,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 10:40:10,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 10:40:10,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:40:10,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:40:10,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 10:40:10,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:40:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 5768 proven. 312 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2025-03-08 10:40:12,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:40:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 309 proven. 321 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-03-08 10:40:13,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484529455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:40:13,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:40:13,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 41 [2025-03-08 10:40:13,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812872833] [2025-03-08 10:40:13,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:40:13,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 10:40:13,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:40:13,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 10:40:13,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 10:40:13,258 INFO L87 Difference]: Start difference. First operand 5074 states and 7909 transitions. Second operand has 41 states, 41 states have (on average 4.463414634146342) internal successors, (183), 41 states have internal predecessors, (183), 9 states have call successors, (150), 4 states have call predecessors, (150), 10 states have return successors, (151), 9 states have call predecessors, (151), 9 states have call successors, (151)